/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:17:07,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:17:07,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:17:07,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:17:07,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:17:07,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:17:07,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:17:07,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:17:07,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:17:07,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:17:07,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:17:07,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:17:07,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:17:07,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:17:07,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:17:07,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:17:07,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:17:07,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:17:07,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:17:07,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:17:07,190 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:17:07,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:17:07,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:17:07,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:17:07,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:17:07,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:17:07,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:17:07,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:17:07,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:17:07,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:17:07,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:17:07,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:17:07,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:17:07,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:17:07,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:17:07,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:17:07,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:17:07,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:17:07,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:17:07,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:17:07,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:17:07,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:17:07,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:17:07,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:17:07,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:17:07,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:17:07,214 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:17:07,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:17:07,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:17:07,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:17:07,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:17:07,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:17:07,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:17:07,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:17:07,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:17:07,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:17:07,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:17:07,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:17:07,216 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:17:07,217 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-15 11:17:07,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:17:07,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:17:07,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:17:07,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:17:07,430 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:17:07,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2022-04-15 11:17:07,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e20d14c3/e2a1b60bfab04e9b81d090a3e1ff87c1/FLAGfb6e1fb18 [2022-04-15 11:17:07,826 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:17:07,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-15 11:17:07,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e20d14c3/e2a1b60bfab04e9b81d090a3e1ff87c1/FLAGfb6e1fb18 [2022-04-15 11:17:08,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e20d14c3/e2a1b60bfab04e9b81d090a3e1ff87c1 [2022-04-15 11:17:08,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:17:08,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:17:08,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:17:08,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:17:08,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:17:08,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb2ce67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08, skipping insertion in model container [2022-04-15 11:17:08,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:17:08,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:17:08,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c[3901,3914] [2022-04-15 11:17:08,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:17:08,464 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:17:08,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c[3901,3914] [2022-04-15 11:17:08,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:17:08,520 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:17:08,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08 WrapperNode [2022-04-15 11:17:08,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:17:08,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:17:08,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:17:08,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:17:08,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:17:08,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:17:08,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:17:08,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:17:08,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (1/1) ... [2022-04-15 11:17:08,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:17:08,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:17:08,608 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-15 11:17:08,610 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-15 11:17:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:17:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:17:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:17:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:17:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:17:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:17:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:17:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:17:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:17:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:17:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:17:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:17:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:17:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:17:08,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:17:08,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:17:08,686 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:17:08,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:17:08,869 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:17:08,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:17:08,874 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:17:08,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:17:08 BoogieIcfgContainer [2022-04-15 11:17:08,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:17:08,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:17:08,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:17:08,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:17:08,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:17:08" (1/3) ... [2022-04-15 11:17:08,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcb070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:17:08, skipping insertion in model container [2022-04-15 11:17:08,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:08" (2/3) ... [2022-04-15 11:17:08,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcb070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:17:08, skipping insertion in model container [2022-04-15 11:17:08,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:17:08" (3/3) ... [2022-04-15 11:17:08,884 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2022-04-15 11:17:08,893 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:17:08,893 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:17:08,935 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:17:08,939 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-15 11:17:08,964 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:17:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:17:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:17:09,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:09,010 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:09,011 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:09,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 1 times [2022-04-15 11:17:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:09,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105333517] [2022-04-15 11:17:09,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 2 times [2022-04-15 11:17:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:09,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086089913] [2022-04-15 11:17:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:09,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48#true} is VALID [2022-04-15 11:17:09,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-15 11:17:09,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-15 11:17:09,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:09,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48#true} is VALID [2022-04-15 11:17:09,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-15 11:17:09,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-15 11:17:09,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret15 := main(); {48#true} is VALID [2022-04-15 11:17:09,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {48#true} is VALID [2022-04-15 11:17:09,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {48#true} is VALID [2022-04-15 11:17:09,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {48#true} is VALID [2022-04-15 11:17:09,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#true} assume 0 != ~p1~0;~lk1~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p1~0; {53#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:09,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {49#false} is VALID [2022-04-15 11:17:09,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} assume !false; {49#false} is VALID [2022-04-15 11:17:09,266 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-15 11:17:09,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:09,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086089913] [2022-04-15 11:17:09,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086089913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:09,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:09,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:09,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:09,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105333517] [2022-04-15 11:17:09,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105333517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:09,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:09,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:09,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193494616] [2022-04-15 11:17:09,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 11:17:09,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:09,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:09,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:09,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:09,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:09,335 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:09,560 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-04-15 11:17:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 11:17:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 11:17:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 11:17:09,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 11:17:09,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:09,712 INFO L225 Difference]: With dead ends: 88 [2022-04-15 11:17:09,712 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 11:17:09,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:09,717 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:09,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 11:17:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-15 11:17:09,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:09,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,756 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,757 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:09,763 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-15 11:17:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-15 11:17:09,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:09,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:09,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 11:17:09,766 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 11:17:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:09,774 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-15 11:17:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-15 11:17:09,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:09,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:09,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:09,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-15 11:17:09,782 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-15 11:17:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:09,782 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-15 11:17:09,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 90 transitions. [2022-04-15 11:17:09,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-15 11:17:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:17:09,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:09,852 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:09,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:17:09,852 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:09,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 1 times [2022-04-15 11:17:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:09,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848894104] [2022-04-15 11:17:09,854 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 2 times [2022-04-15 11:17:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:09,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040895153] [2022-04-15 11:17:09,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:09,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:09,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {484#true} is VALID [2022-04-15 11:17:09,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-15 11:17:09,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-15 11:17:09,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {484#true} call ULTIMATE.init(); {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:09,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {484#true} is VALID [2022-04-15 11:17:09,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-15 11:17:09,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-15 11:17:09,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} call #t~ret15 := main(); {484#true} is VALID [2022-04-15 11:17:09,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {484#true} is VALID [2022-04-15 11:17:09,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {484#true} is VALID [2022-04-15 11:17:09,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {484#true} is VALID [2022-04-15 11:17:09,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#true} assume !(0 != ~p1~0); {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(= main_~p1~0 0)} assume !(0 != ~p2~0); {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {489#(= main_~p1~0 0)} assume !(0 != ~p10~0); {489#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:09,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p1~0; {485#false} is VALID [2022-04-15 11:17:09,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#false} assume 1 != ~lk1~0; {485#false} is VALID [2022-04-15 11:17:09,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#false} assume !false; {485#false} is VALID [2022-04-15 11:17:09,911 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-15 11:17:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040895153] [2022-04-15 11:17:09,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040895153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:09,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:09,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:09,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:09,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848894104] [2022-04-15 11:17:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848894104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:09,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470314483] [2022-04-15 11:17:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:09,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 11:17:09,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:09,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:09,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:09,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:09,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:09,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:09,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:09,928 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:10,090 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-04-15 11:17:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:10,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 11:17:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-15 11:17:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-15 11:17:10,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-15 11:17:10,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:10,238 INFO L225 Difference]: With dead ends: 118 [2022-04-15 11:17:10,238 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 11:17:10,238 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-15 11:17:10,239 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:10,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 11:17:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-15 11:17:10,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:10,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,248 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,248 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:10,250 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-15 11:17:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-15 11:17:10,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:10,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:10,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 11:17:10,251 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 11:17:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:10,253 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-15 11:17:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-15 11:17:10,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:10,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:10,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:10,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-15 11:17:10,256 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-15 11:17:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:10,256 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-15 11:17:10,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 126 transitions. [2022-04-15 11:17:10,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-15 11:17:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:17:10,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:10,356 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:10,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:17:10,356 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 1 times [2022-04-15 11:17:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:10,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1234961481] [2022-04-15 11:17:10,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 2 times [2022-04-15 11:17:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:10,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42417187] [2022-04-15 11:17:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:10,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1020#true} is VALID [2022-04-15 11:17:10,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-15 11:17:10,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-15 11:17:10,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {1020#true} call ULTIMATE.init(); {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:10,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1020#true} is VALID [2022-04-15 11:17:10,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-15 11:17:10,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-15 11:17:10,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {1020#true} call #t~ret15 := main(); {1020#true} is VALID [2022-04-15 11:17:10,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {1020#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {1020#true} is VALID [2022-04-15 11:17:10,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {1020#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1020#true} is VALID [2022-04-15 11:17:10,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1020#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1020#true} is VALID [2022-04-15 11:17:10,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1020#true} assume 0 != ~p1~0;~lk1~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1025#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:10,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1021#false} is VALID [2022-04-15 11:17:10,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {1021#false} assume 0 != ~p2~0; {1021#false} is VALID [2022-04-15 11:17:10,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {1021#false} assume 1 != ~lk2~0; {1021#false} is VALID [2022-04-15 11:17:10,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2022-04-15 11:17:10,418 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-15 11:17:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:10,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42417187] [2022-04-15 11:17:10,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42417187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:10,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:10,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:10,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:10,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1234961481] [2022-04-15 11:17:10,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1234961481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:10,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:10,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:10,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355819053] [2022-04-15 11:17:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:10,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:10,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:10,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:10,433 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:10,433 INFO L87 Difference]: Start difference. First operand 71 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:10,589 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-04-15 11:17:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:10,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 11:17:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 11:17:10,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-15 11:17:10,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:10,730 INFO L225 Difference]: With dead ends: 109 [2022-04-15 11:17:10,730 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 11:17:10,730 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-15 11:17:10,731 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:10,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 11:17:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-15 11:17:10,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:10,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,739 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,739 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:10,741 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-15 11:17:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-15 11:17:10,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:10,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:10,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 11:17:10,742 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 11:17:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:10,744 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-15 11:17:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-15 11:17:10,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:10,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:10,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:10,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-15 11:17:10,747 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-15 11:17:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:10,747 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-15 11:17:10,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 128 transitions. [2022-04-15 11:17:10,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-15 11:17:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:17:10,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:10,858 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:10,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:17:10,858 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:10,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 1 times [2022-04-15 11:17:10,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:10,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1058566346] [2022-04-15 11:17:10,859 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 2 times [2022-04-15 11:17:10,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:10,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661701424] [2022-04-15 11:17:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:10,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:10,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {1556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-15 11:17:10,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-15 11:17:10,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-15 11:17:10,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:10,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-15 11:17:10,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-15 11:17:10,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-15 11:17:10,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret15 := main(); {1550#true} is VALID [2022-04-15 11:17:10,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {1550#true} is VALID [2022-04-15 11:17:10,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1550#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1550#true} is VALID [2022-04-15 11:17:10,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1550#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1550#true} is VALID [2022-04-15 11:17:10,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#true} assume !(0 != ~p1~0); {1550#true} is VALID [2022-04-15 11:17:10,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#true} assume !(0 != ~p2~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {1555#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:10,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p2~0; {1551#false} is VALID [2022-04-15 11:17:10,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {1551#false} assume 1 != ~lk2~0; {1551#false} is VALID [2022-04-15 11:17:10,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-15 11:17:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:10,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:10,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661701424] [2022-04-15 11:17:10,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661701424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:10,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:10,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:10,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:10,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1058566346] [2022-04-15 11:17:10,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1058566346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:10,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612658349] [2022-04-15 11:17:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:10,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:10,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:10,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:10,924 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:10,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:10,925 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,085 INFO L93 Difference]: Finished difference Result 202 states and 360 transitions. [2022-04-15 11:17:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:11,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-15 11:17:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-15 11:17:11,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-15 11:17:11,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,222 INFO L225 Difference]: With dead ends: 202 [2022-04-15 11:17:11,222 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 11:17:11,223 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-15 11:17:11,223 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:11,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 79 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 11:17:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-15 11:17:11,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:11,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,234 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,234 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,237 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-15 11:17:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-15 11:17:11,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:11,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:11,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 11:17:11,239 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 11:17:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,242 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-15 11:17:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-15 11:17:11,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:11,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:11,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:11,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 237 transitions. [2022-04-15 11:17:11,246 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 237 transitions. Word has length 22 [2022-04-15 11:17:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:11,246 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 237 transitions. [2022-04-15 11:17:11,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 237 transitions. [2022-04-15 11:17:11,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2022-04-15 11:17:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:17:11,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:11,416 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:11,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:17:11,417 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 1 times [2022-04-15 11:17:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:11,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1805039933] [2022-04-15 11:17:11,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 2 times [2022-04-15 11:17:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:11,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038008031] [2022-04-15 11:17:11,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:11,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:11,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {2516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2510#true} is VALID [2022-04-15 11:17:11,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-15 11:17:11,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-15 11:17:11,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {2510#true} call ULTIMATE.init(); {2516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:11,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2510#true} is VALID [2022-04-15 11:17:11,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-15 11:17:11,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-15 11:17:11,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#true} call #t~ret15 := main(); {2510#true} is VALID [2022-04-15 11:17:11,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {2510#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {2510#true} is VALID [2022-04-15 11:17:11,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {2510#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {2510#true} is VALID [2022-04-15 11:17:11,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {2510#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2510#true} is VALID [2022-04-15 11:17:11,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {2510#true} assume !(0 != ~p1~0); {2510#true} is VALID [2022-04-15 11:17:11,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {2510#true} assume 0 != ~p2~0;~lk2~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {2515#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {2515#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2515#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:11,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {2515#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2511#false} is VALID [2022-04-15 11:17:11,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {2511#false} assume !false; {2511#false} is VALID [2022-04-15 11:17:11,499 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-15 11:17:11,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038008031] [2022-04-15 11:17:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038008031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:11,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:11,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:11,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1805039933] [2022-04-15 11:17:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1805039933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:11,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:11,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744142220] [2022-04-15 11:17:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:11,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:11,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:11,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:11,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:11,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:11,530 INFO L87 Difference]: Start difference. First operand 135 states and 237 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,683 INFO L93 Difference]: Finished difference Result 175 states and 307 transitions. [2022-04-15 11:17:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:11,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:17:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-15 11:17:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-15 11:17:11,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-15 11:17:11,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,782 INFO L225 Difference]: With dead ends: 175 [2022-04-15 11:17:11,782 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 11:17:11,782 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-15 11:17:11,783 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:11,783 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 128 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 11:17:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2022-04-15 11:17:11,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:11,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,793 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,793 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,797 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-15 11:17:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-15 11:17:11,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:11,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:11,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-15 11:17:11,798 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-15 11:17:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,801 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-15 11:17:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-15 11:17:11,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:11,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:11,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:11,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-15 11:17:11,804 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-15 11:17:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:11,805 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-15 11:17:11,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:11,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 235 transitions. [2022-04-15 11:17:11,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-15 11:17:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:17:11,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:11,997 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:11,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:17:11,997 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 1 times [2022-04-15 11:17:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:11,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [662818058] [2022-04-15 11:17:11,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 2 times [2022-04-15 11:17:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:11,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267546711] [2022-04-15 11:17:11,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3488#true} is VALID [2022-04-15 11:17:12,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-15 11:17:12,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-15 11:17:12,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {3488#true} call ULTIMATE.init(); {3494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:12,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3488#true} is VALID [2022-04-15 11:17:12,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-15 11:17:12,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-15 11:17:12,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {3488#true} call #t~ret15 := main(); {3488#true} is VALID [2022-04-15 11:17:12,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {3488#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {3488#true} is VALID [2022-04-15 11:17:12,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {3488#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {3488#true} is VALID [2022-04-15 11:17:12,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {3488#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {3488#true} is VALID [2022-04-15 11:17:12,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {3488#true} assume !(0 != ~p1~0); {3488#true} is VALID [2022-04-15 11:17:12,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {3488#true} assume !(0 != ~p2~0); {3488#true} is VALID [2022-04-15 11:17:12,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {3488#true} assume 0 != ~p3~0;~lk3~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3493#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:12,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {3493#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3489#false} is VALID [2022-04-15 11:17:12,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {3489#false} assume !false; {3489#false} is VALID [2022-04-15 11:17:12,037 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-15 11:17:12,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:12,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267546711] [2022-04-15 11:17:12,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267546711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:12,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [662818058] [2022-04-15 11:17:12,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [662818058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475141392] [2022-04-15 11:17:12,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:12,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:12,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:12,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:12,053 INFO L87 Difference]: Start difference. First operand 135 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,209 INFO L93 Difference]: Finished difference Result 251 states and 443 transitions. [2022-04-15 11:17:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 11:17:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 11:17:12,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-15 11:17:12,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,305 INFO L225 Difference]: With dead ends: 251 [2022-04-15 11:17:12,305 INFO L226 Difference]: Without dead ends: 249 [2022-04-15 11:17:12,305 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-15 11:17:12,306 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:12,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-15 11:17:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2022-04-15 11:17:12,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:12,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,330 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,330 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,336 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-15 11:17:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-15 11:17:12,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:12,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:12,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-15 11:17:12,337 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-15 11:17:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,343 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-15 11:17:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-15 11:17:12,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:12,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:12,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:12,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 317 transitions. [2022-04-15 11:17:12,349 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 317 transitions. Word has length 23 [2022-04-15 11:17:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:12,349 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 317 transitions. [2022-04-15 11:17:12,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 317 transitions. [2022-04-15 11:17:12,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 317 transitions. [2022-04-15 11:17:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:17:12,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:12,628 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:12,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:17:12,628 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 1 times [2022-04-15 11:17:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032553835] [2022-04-15 11:17:12,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 2 times [2022-04-15 11:17:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:12,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392587250] [2022-04-15 11:17:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {4872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4866#true} is VALID [2022-04-15 11:17:12,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-15 11:17:12,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-15 11:17:12,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {4866#true} call ULTIMATE.init(); {4872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:12,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {4872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4866#true} is VALID [2022-04-15 11:17:12,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-15 11:17:12,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-15 11:17:12,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {4866#true} call #t~ret15 := main(); {4866#true} is VALID [2022-04-15 11:17:12,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {4866#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {4866#true} is VALID [2022-04-15 11:17:12,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {4866#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {4866#true} is VALID [2022-04-15 11:17:12,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {4866#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {4866#true} is VALID [2022-04-15 11:17:12,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#true} assume !(0 != ~p1~0); {4866#true} is VALID [2022-04-15 11:17:12,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#true} assume !(0 != ~p2~0); {4866#true} is VALID [2022-04-15 11:17:12,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {4866#true} assume !(0 != ~p3~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p10~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:12,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p3~0; {4867#false} is VALID [2022-04-15 11:17:12,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {4867#false} assume 1 != ~lk3~0; {4867#false} is VALID [2022-04-15 11:17:12,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {4867#false} assume !false; {4867#false} is VALID [2022-04-15 11:17:12,672 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-15 11:17:12,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:12,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392587250] [2022-04-15 11:17:12,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392587250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:12,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032553835] [2022-04-15 11:17:12,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032553835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194450506] [2022-04-15 11:17:12,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:12,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:12,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:12,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:12,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:12,686 INFO L87 Difference]: Start difference. First operand 183 states and 317 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,854 INFO L93 Difference]: Finished difference Result 431 states and 755 transitions. [2022-04-15 11:17:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:12,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:17:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-15 11:17:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-15 11:17:12,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-15 11:17:12,983 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-15 11:17:12,987 INFO L225 Difference]: With dead ends: 431 [2022-04-15 11:17:12,987 INFO L226 Difference]: Without dead ends: 257 [2022-04-15 11:17:12,988 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-15 11:17:12,989 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:12,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-15 11:17:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2022-04-15 11:17:13,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:13,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,002 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,003 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,008 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-15 11:17:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-15 11:17:13,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-15 11:17:13,010 INFO L87 Difference]: Start difference. First operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-15 11:17:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,015 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-15 11:17:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-15 11:17:13,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:13,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 439 transitions. [2022-04-15 11:17:13,021 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 439 transitions. Word has length 23 [2022-04-15 11:17:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:13,021 INFO L478 AbstractCegarLoop]: Abstraction has 255 states and 439 transitions. [2022-04-15 11:17:13,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 255 states and 439 transitions. [2022-04-15 11:17:13,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 439 transitions. [2022-04-15 11:17:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:17:13,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:13,374 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:13,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:17:13,375 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 1 times [2022-04-15 11:17:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1470126073] [2022-04-15 11:17:13,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:13,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 2 times [2022-04-15 11:17:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:13,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875639206] [2022-04-15 11:17:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {6770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6764#true} is VALID [2022-04-15 11:17:13,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-15 11:17:13,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-15 11:17:13,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {6764#true} call ULTIMATE.init(); {6770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:13,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {6770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6764#true} is VALID [2022-04-15 11:17:13,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-15 11:17:13,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-15 11:17:13,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {6764#true} call #t~ret15 := main(); {6764#true} is VALID [2022-04-15 11:17:13,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {6764#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {6764#true} is VALID [2022-04-15 11:17:13,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {6764#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {6764#true} is VALID [2022-04-15 11:17:13,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {6764#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {6764#true} is VALID [2022-04-15 11:17:13,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {6764#true} assume !(0 != ~p1~0); {6764#true} is VALID [2022-04-15 11:17:13,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {6764#true} assume !(0 != ~p2~0); {6764#true} is VALID [2022-04-15 11:17:13,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {6764#true} assume 0 != ~p3~0;~lk3~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:13,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6765#false} is VALID [2022-04-15 11:17:13,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {6765#false} assume 0 != ~p4~0; {6765#false} is VALID [2022-04-15 11:17:13,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {6765#false} assume 1 != ~lk4~0; {6765#false} is VALID [2022-04-15 11:17:13,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {6765#false} assume !false; {6765#false} is VALID [2022-04-15 11:17:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:13,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875639206] [2022-04-15 11:17:13,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875639206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:13,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1470126073] [2022-04-15 11:17:13,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1470126073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848441640] [2022-04-15 11:17:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:13,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:13,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:13,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:13,501 INFO L87 Difference]: Start difference. First operand 255 states and 439 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,639 INFO L93 Difference]: Finished difference Result 385 states and 661 transitions. [2022-04-15 11:17:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:13,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-15 11:17:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-15 11:17:13,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-15 11:17:13,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,765 INFO L225 Difference]: With dead ends: 385 [2022-04-15 11:17:13,765 INFO L226 Difference]: Without dead ends: 263 [2022-04-15 11:17:13,766 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-15 11:17:13,766 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:13,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-15 11:17:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-15 11:17:13,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:13,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,779 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,780 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,784 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-15 11:17:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-15 11:17:13,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-15 11:17:13,786 INFO L87 Difference]: Start difference. First operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-15 11:17:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,790 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-15 11:17:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-15 11:17:13,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:13,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 443 transitions. [2022-04-15 11:17:13,795 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 443 transitions. Word has length 24 [2022-04-15 11:17:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:13,795 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 443 transitions. [2022-04-15 11:17:13,795 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 443 transitions. [2022-04-15 11:17:14,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 443 transitions. [2022-04-15 11:17:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:17:14,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:14,146 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:14,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:17:14,146 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 1 times [2022-04-15 11:17:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380887190] [2022-04-15 11:17:14,147 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 2 times [2022-04-15 11:17:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:14,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096854705] [2022-04-15 11:17:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {8600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8594#true} is VALID [2022-04-15 11:17:14,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-15 11:17:14,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-15 11:17:14,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {8594#true} call ULTIMATE.init(); {8600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:14,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {8600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8594#true} is VALID [2022-04-15 11:17:14,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-15 11:17:14,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-15 11:17:14,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {8594#true} call #t~ret15 := main(); {8594#true} is VALID [2022-04-15 11:17:14,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {8594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {8594#true} is VALID [2022-04-15 11:17:14,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {8594#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {8594#true} is VALID [2022-04-15 11:17:14,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {8594#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {8594#true} is VALID [2022-04-15 11:17:14,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#true} assume !(0 != ~p1~0); {8594#true} is VALID [2022-04-15 11:17:14,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#true} assume !(0 != ~p2~0); {8594#true} is VALID [2022-04-15 11:17:14,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#true} assume !(0 != ~p3~0); {8594#true} is VALID [2022-04-15 11:17:14,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {8594#true} assume 0 != ~p4~0;~lk4~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p4~0; {8599#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:14,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {8599#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {8595#false} is VALID [2022-04-15 11:17:14,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {8595#false} assume !false; {8595#false} is VALID [2022-04-15 11:17:14,207 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-15 11:17:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096854705] [2022-04-15 11:17:14,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096854705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380887190] [2022-04-15 11:17:14,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380887190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099049797] [2022-04-15 11:17:14,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:14,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:14,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:14,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:14,222 INFO L87 Difference]: Start difference. First operand 261 states and 443 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,362 INFO L93 Difference]: Finished difference Result 477 states and 821 transitions. [2022-04-15 11:17:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:14,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 11:17:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 11:17:14,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-15 11:17:14,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,442 INFO L225 Difference]: With dead ends: 477 [2022-04-15 11:17:14,442 INFO L226 Difference]: Without dead ends: 475 [2022-04-15 11:17:14,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-15 11:17:14,443 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:14,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-15 11:17:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-15 11:17:14,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:14,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,461 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,461 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,470 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-15 11:17:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-15 11:17:14,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:14,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:14,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 475 states. [2022-04-15 11:17:14,472 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 475 states. [2022-04-15 11:17:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,481 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-15 11:17:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-15 11:17:14,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:14,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:14,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:14,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2022-04-15 11:17:14,489 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 24 [2022-04-15 11:17:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:14,489 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2022-04-15 11:17:14,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 603 transitions. [2022-04-15 11:17:14,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2022-04-15 11:17:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:17:14,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:14,987 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:14,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:17:14,987 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 1 times [2022-04-15 11:17:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1290379451] [2022-04-15 11:17:14,988 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 2 times [2022-04-15 11:17:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:14,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562820450] [2022-04-15 11:17:14,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:15,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:15,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {11238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11232#true} is VALID [2022-04-15 11:17:15,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-15 11:17:15,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-15 11:17:15,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {11232#true} call ULTIMATE.init(); {11238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:15,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11232#true} is VALID [2022-04-15 11:17:15,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {11232#true} call #t~ret15 := main(); {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {11232#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {11232#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {11232#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {11232#true} assume !(0 != ~p1~0); {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {11232#true} assume !(0 != ~p2~0); {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {11232#true} assume !(0 != ~p3~0); {11232#true} is VALID [2022-04-15 11:17:15,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {11232#true} assume !(0 != ~p4~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p10~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p1~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p2~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p3~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:15,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p4~0; {11233#false} is VALID [2022-04-15 11:17:15,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {11233#false} assume 1 != ~lk4~0; {11233#false} is VALID [2022-04-15 11:17:15,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {11233#false} assume !false; {11233#false} is VALID [2022-04-15 11:17:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:15,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562820450] [2022-04-15 11:17:15,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562820450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:15,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:15,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:15,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:15,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1290379451] [2022-04-15 11:17:15,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1290379451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:15,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:15,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971454048] [2022-04-15 11:17:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:15,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:15,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:15,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:15,035 INFO L87 Difference]: Start difference. First operand 361 states and 603 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,230 INFO L93 Difference]: Finished difference Result 845 states and 1421 transitions. [2022-04-15 11:17:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:17:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 11:17:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 11:17:15,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-15 11:17:15,328 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-15 11:17:15,338 INFO L225 Difference]: With dead ends: 845 [2022-04-15 11:17:15,338 INFO L226 Difference]: Without dead ends: 499 [2022-04-15 11:17:15,339 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-15 11:17:15,339 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:15,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-15 11:17:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-15 11:17:15,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:15,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,365 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,366 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,375 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-15 11:17:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-15 11:17:15,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 499 states. [2022-04-15 11:17:15,377 INFO L87 Difference]: Start difference. First operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 499 states. [2022-04-15 11:17:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,386 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-15 11:17:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-15 11:17:15,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:15,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 823 transitions. [2022-04-15 11:17:15,399 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 823 transitions. Word has length 24 [2022-04-15 11:17:15,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:15,399 INFO L478 AbstractCegarLoop]: Abstraction has 497 states and 823 transitions. [2022-04-15 11:17:15,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 497 states and 823 transitions. [2022-04-15 11:17:16,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 823 transitions. [2022-04-15 11:17:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:16,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:16,114 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:16,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:17:16,114 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 1 times [2022-04-15 11:17:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1207129354] [2022-04-15 11:17:16,115 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 2 times [2022-04-15 11:17:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:16,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669024808] [2022-04-15 11:17:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14926#true} is VALID [2022-04-15 11:17:16,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-15 11:17:16,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-15 11:17:16,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {14926#true} call ULTIMATE.init(); {14932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:16,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14926#true} is VALID [2022-04-15 11:17:16,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-15 11:17:16,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-15 11:17:16,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {14926#true} call #t~ret15 := main(); {14926#true} is VALID [2022-04-15 11:17:16,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {14926#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {14926#true} is VALID [2022-04-15 11:17:16,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {14926#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {14926#true} is VALID [2022-04-15 11:17:16,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {14926#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {14926#true} is VALID [2022-04-15 11:17:16,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {14926#true} assume !(0 != ~p1~0); {14926#true} is VALID [2022-04-15 11:17:16,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {14926#true} assume !(0 != ~p2~0); {14926#true} is VALID [2022-04-15 11:17:16,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {14926#true} assume !(0 != ~p3~0); {14926#true} is VALID [2022-04-15 11:17:16,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {14926#true} assume 0 != ~p4~0;~lk4~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:16,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {14927#false} is VALID [2022-04-15 11:17:16,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {14927#false} assume 0 != ~p5~0; {14927#false} is VALID [2022-04-15 11:17:16,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {14927#false} assume 1 != ~lk5~0; {14927#false} is VALID [2022-04-15 11:17:16,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {14927#false} assume !false; {14927#false} is VALID [2022-04-15 11:17:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:16,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669024808] [2022-04-15 11:17:16,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669024808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:16,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1207129354] [2022-04-15 11:17:16,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1207129354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789133227] [2022-04-15 11:17:16,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:16,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:16,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:16,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:16,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:16,162 INFO L87 Difference]: Start difference. First operand 497 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,320 INFO L93 Difference]: Finished difference Result 745 states and 1229 transitions. [2022-04-15 11:17:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-15 11:17:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-15 11:17:16,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-15 11:17:16,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,428 INFO L225 Difference]: With dead ends: 745 [2022-04-15 11:17:16,428 INFO L226 Difference]: Without dead ends: 507 [2022-04-15 11:17:16,429 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-15 11:17:16,430 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:16,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-15 11:17:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-15 11:17:16,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:16,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,475 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,475 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,487 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-15 11:17:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-15 11:17:16,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:16,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:16,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 507 states. [2022-04-15 11:17:16,489 INFO L87 Difference]: Start difference. First operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 507 states. [2022-04-15 11:17:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,499 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-15 11:17:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-15 11:17:16,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:16,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:16,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:16,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2022-04-15 11:17:16,511 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 25 [2022-04-15 11:17:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:16,511 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2022-04-15 11:17:16,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 823 transitions. [2022-04-15 11:17:17,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2022-04-15 11:17:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:17,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:17,221 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:17,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:17:17,221 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 1 times [2022-04-15 11:17:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:17,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188225874] [2022-04-15 11:17:17,222 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 2 times [2022-04-15 11:17:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:17,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030950635] [2022-04-15 11:17:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:17,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:17,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {18452#true} is VALID [2022-04-15 11:17:17,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-15 11:17:17,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {18452#true} call ULTIMATE.init(); {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:17,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {18452#true} call #t~ret15 := main(); {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {18452#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {18452#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {18452#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {18452#true} assume !(0 != ~p1~0); {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {18452#true} assume !(0 != ~p2~0); {18452#true} is VALID [2022-04-15 11:17:17,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {18452#true} assume !(0 != ~p3~0); {18452#true} is VALID [2022-04-15 11:17:17,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {18452#true} assume !(0 != ~p4~0); {18452#true} is VALID [2022-04-15 11:17:17,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {18452#true} assume 0 != ~p5~0;~lk5~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p5~0; {18457#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:17,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {18457#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {18453#false} is VALID [2022-04-15 11:17:17,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {18453#false} assume !false; {18453#false} is VALID [2022-04-15 11:17:17,281 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-15 11:17:17,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:17,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030950635] [2022-04-15 11:17:17,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030950635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:17,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:17,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:17,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:17,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188225874] [2022-04-15 11:17:17,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188225874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:17,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:17,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:17,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741671170] [2022-04-15 11:17:17,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:17,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:17,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:17,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:17,296 INFO L87 Difference]: Start difference. First operand 505 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,505 INFO L93 Difference]: Finished difference Result 909 states and 1505 transitions. [2022-04-15 11:17:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:17,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 11:17:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 11:17:17,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-15 11:17:17,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,604 INFO L225 Difference]: With dead ends: 909 [2022-04-15 11:17:17,604 INFO L226 Difference]: Without dead ends: 907 [2022-04-15 11:17:17,605 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-15 11:17:17,605 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:17,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-15 11:17:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-15 11:17:17,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:17,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,645 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,646 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,670 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-15 11:17:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-15 11:17:17,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:17,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:17,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 907 states. [2022-04-15 11:17:17,673 INFO L87 Difference]: Start difference. First operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 907 states. [2022-04-15 11:17:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,698 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-15 11:17:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-15 11:17:17,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:17,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:17,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:17,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1135 transitions. [2022-04-15 11:17:17,730 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1135 transitions. Word has length 25 [2022-04-15 11:17:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:17,731 INFO L478 AbstractCegarLoop]: Abstraction has 713 states and 1135 transitions. [2022-04-15 11:17:17,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 713 states and 1135 transitions. [2022-04-15 11:17:18,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1135 edges. 1135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1135 transitions. [2022-04-15 11:17:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:18,754 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:18,754 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:18,754 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:17:18,754 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 1 times [2022-04-15 11:17:18,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:18,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213217154] [2022-04-15 11:17:18,756 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 2 times [2022-04-15 11:17:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:18,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015136107] [2022-04-15 11:17:18,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:18,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {23528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23522#true} is VALID [2022-04-15 11:17:18,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-15 11:17:18,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-15 11:17:18,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {23522#true} call ULTIMATE.init(); {23528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:18,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {23528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23522#true} is VALID [2022-04-15 11:17:18,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-15 11:17:18,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-15 11:17:18,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {23522#true} call #t~ret15 := main(); {23522#true} is VALID [2022-04-15 11:17:18,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {23522#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {23522#true} is VALID [2022-04-15 11:17:18,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {23522#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {23522#true} is VALID [2022-04-15 11:17:18,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {23522#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {23522#true} is VALID [2022-04-15 11:17:18,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {23522#true} assume !(0 != ~p1~0); {23522#true} is VALID [2022-04-15 11:17:18,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {23522#true} assume !(0 != ~p2~0); {23522#true} is VALID [2022-04-15 11:17:18,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {23522#true} assume !(0 != ~p3~0); {23522#true} is VALID [2022-04-15 11:17:18,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {23522#true} assume !(0 != ~p4~0); {23522#true} is VALID [2022-04-15 11:17:18,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {23522#true} assume !(0 != ~p5~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p10~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p1~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p2~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p3~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p4~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:18,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p5~0; {23523#false} is VALID [2022-04-15 11:17:18,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {23523#false} assume 1 != ~lk5~0; {23523#false} is VALID [2022-04-15 11:17:18,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {23523#false} assume !false; {23523#false} is VALID [2022-04-15 11:17:18,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-15 11:17:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015136107] [2022-04-15 11:17:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015136107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:18,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:18,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:18,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213217154] [2022-04-15 11:17:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213217154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:18,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:18,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002042797] [2022-04-15 11:17:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:18,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:18,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:18,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:18,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:18,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:18,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:18,825 INFO L87 Difference]: Start difference. First operand 713 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,107 INFO L93 Difference]: Finished difference Result 1661 states and 2657 transitions. [2022-04-15 11:17:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:19,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-15 11:17:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-15 11:17:19,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-15 11:17:19,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:19,271 INFO L225 Difference]: With dead ends: 1661 [2022-04-15 11:17:19,271 INFO L226 Difference]: Without dead ends: 971 [2022-04-15 11:17:19,272 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-15 11:17:19,273 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:19,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-15 11:17:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-15 11:17:19,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:19,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,330 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,332 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,357 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-15 11:17:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-15 11:17:19,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:19,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:19,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 971 states. [2022-04-15 11:17:19,363 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 971 states. [2022-04-15 11:17:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,389 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-15 11:17:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-15 11:17:19,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:19,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:19,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:19,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1527 transitions. [2022-04-15 11:17:19,426 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1527 transitions. Word has length 25 [2022-04-15 11:17:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:19,427 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1527 transitions. [2022-04-15 11:17:19,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1527 transitions. [2022-04-15 11:17:20,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1527 edges. 1527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1527 transitions. [2022-04-15 11:17:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:20,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:20,672 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-15 11:17:20,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:17:20,672 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 1 times [2022-04-15 11:17:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:20,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852715720] [2022-04-15 11:17:20,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 2 times [2022-04-15 11:17:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:20,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504427778] [2022-04-15 11:17:20,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:20,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {30742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30736#true} is VALID [2022-04-15 11:17:20,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-15 11:17:20,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {30736#true} call ULTIMATE.init(); {30742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:20,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {30742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {30736#true} call #t~ret15 := main(); {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {30736#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {30736#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {30736#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {30736#true} assume !(0 != ~p1~0); {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {30736#true} assume !(0 != ~p2~0); {30736#true} is VALID [2022-04-15 11:17:20,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {30736#true} assume !(0 != ~p3~0); {30736#true} is VALID [2022-04-15 11:17:20,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {30736#true} assume !(0 != ~p4~0); {30736#true} is VALID [2022-04-15 11:17:20,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {30736#true} assume 0 != ~p5~0;~lk5~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:20,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {30737#false} is VALID [2022-04-15 11:17:20,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {30737#false} assume 0 != ~p6~0; {30737#false} is VALID [2022-04-15 11:17:20,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {30737#false} assume 1 != ~lk6~0; {30737#false} is VALID [2022-04-15 11:17:20,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {30737#false} assume !false; {30737#false} is VALID [2022-04-15 11:17:20,729 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-15 11:17:20,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:20,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504427778] [2022-04-15 11:17:20,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504427778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:20,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:20,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:20,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:20,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852715720] [2022-04-15 11:17:20,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852715720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:20,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:20,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459520165] [2022-04-15 11:17:20,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:20,733 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-15 11:17:20,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:20,733 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-15 11:17:20,746 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-15 11:17:20,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:20,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:20,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:20,748 INFO L87 Difference]: Start difference. First operand 969 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:21,000 INFO L93 Difference]: Finished difference Result 1453 states and 2281 transitions. [2022-04-15 11:17:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:21,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:21,000 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-15 11:17:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 11:17:21,001 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-15 11:17:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 11:17:21,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-15 11:17:21,106 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-15 11:17:21,141 INFO L225 Difference]: With dead ends: 1453 [2022-04-15 11:17:21,142 INFO L226 Difference]: Without dead ends: 987 [2022-04-15 11:17:21,143 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-15 11:17:21,143 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:21,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-15 11:17:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-15 11:17:21,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:21,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,202 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,216 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:21,242 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-15 11:17:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-15 11:17:21,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:21,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:21,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 987 states. [2022-04-15 11:17:21,246 INFO L87 Difference]: Start difference. First operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 987 states. [2022-04-15 11:17:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:21,272 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-15 11:17:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-15 11:17:21,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:21,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:21,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:21,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1527 transitions. [2022-04-15 11:17:21,320 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1527 transitions. Word has length 26 [2022-04-15 11:17:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:21,321 INFO L478 AbstractCegarLoop]: Abstraction has 985 states and 1527 transitions. [2022-04-15 11:17:21,321 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-15 11:17:21,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 985 states and 1527 transitions. [2022-04-15 11:17:22,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1527 edges. 1527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1527 transitions. [2022-04-15 11:17:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:22,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:22,604 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-15 11:17:22,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:17:22,604 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 1 times [2022-04-15 11:17:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [772667347] [2022-04-15 11:17:22,605 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 2 times [2022-04-15 11:17:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:22,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327858538] [2022-04-15 11:17:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:22,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {37604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {37598#true} is VALID [2022-04-15 11:17:22,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-15 11:17:22,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-15 11:17:22,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {37598#true} call ULTIMATE.init(); {37604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {37604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {37598#true} call #t~ret15 := main(); {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {37598#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {37598#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {37598#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {37598#true} assume !(0 != ~p1~0); {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {37598#true} assume !(0 != ~p2~0); {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {37598#true} assume !(0 != ~p3~0); {37598#true} is VALID [2022-04-15 11:17:22,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {37598#true} assume !(0 != ~p4~0); {37598#true} is VALID [2022-04-15 11:17:22,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {37598#true} assume !(0 != ~p5~0); {37598#true} is VALID [2022-04-15 11:17:22,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {37598#true} assume 0 != ~p6~0;~lk6~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p6~0; {37603#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:22,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {37603#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {37599#false} is VALID [2022-04-15 11:17:22,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {37599#false} assume !false; {37599#false} is VALID [2022-04-15 11:17:22,637 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-15 11:17:22,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:22,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327858538] [2022-04-15 11:17:22,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327858538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:22,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:22,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:22,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:22,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [772667347] [2022-04-15 11:17:22,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [772667347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:22,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:22,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344567733] [2022-04-15 11:17:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:22,638 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-15 11:17:22,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:22,638 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-15 11:17:22,655 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-15 11:17:22,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:22,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:22,656 INFO L87 Difference]: Start difference. First operand 985 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,999 INFO L93 Difference]: Finished difference Result 1741 states and 2745 transitions. [2022-04-15 11:17:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:22,999 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-15 11:17:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:23,000 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-15 11:17:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 11:17:23,000 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-15 11:17:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 11:17:23,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-15 11:17:23,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:23,191 INFO L225 Difference]: With dead ends: 1741 [2022-04-15 11:17:23,192 INFO L226 Difference]: Without dead ends: 1739 [2022-04-15 11:17:23,192 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-15 11:17:23,192 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:23,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-15 11:17:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-15 11:17:23,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:23,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,280 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,281 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:23,356 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-15 11:17:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-15 11:17:23,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:23,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:23,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1739 states. [2022-04-15 11:17:23,361 INFO L87 Difference]: Start difference. First operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1739 states. [2022-04-15 11:17:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:23,436 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-15 11:17:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-15 11:17:23,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:23,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:23,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:23,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2022-04-15 11:17:23,550 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 26 [2022-04-15 11:17:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:23,551 INFO L478 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2022-04-15 11:17:23,551 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-15 11:17:23,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1417 states and 2135 transitions. [2022-04-15 11:17:25,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2135 edges. 2135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2022-04-15 11:17:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:25,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:25,559 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-15 11:17:25,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:17:25,559 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 1 times [2022-04-15 11:17:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:25,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882011334] [2022-04-15 11:17:25,560 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 2 times [2022-04-15 11:17:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:25,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389408637] [2022-04-15 11:17:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:25,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {47410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {47404#true} is VALID [2022-04-15 11:17:25,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-15 11:17:25,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {47404#true} call ULTIMATE.init(); {47410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:25,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {47410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {47404#true} call #t~ret15 := main(); {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {47404#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {47404#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {47404#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {47404#true} assume !(0 != ~p1~0); {47404#true} is VALID [2022-04-15 11:17:25,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {47404#true} assume !(0 != ~p2~0); {47404#true} is VALID [2022-04-15 11:17:25,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {47404#true} assume !(0 != ~p3~0); {47404#true} is VALID [2022-04-15 11:17:25,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {47404#true} assume !(0 != ~p4~0); {47404#true} is VALID [2022-04-15 11:17:25,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {47404#true} assume !(0 != ~p5~0); {47404#true} is VALID [2022-04-15 11:17:25,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {47404#true} assume !(0 != ~p6~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p10~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p1~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p2~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p3~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p4~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p5~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:25,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p6~0; {47405#false} is VALID [2022-04-15 11:17:25,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {47405#false} assume 1 != ~lk6~0; {47405#false} is VALID [2022-04-15 11:17:25,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {47405#false} assume !false; {47405#false} is VALID [2022-04-15 11:17:25,610 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-15 11:17:25,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:25,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389408637] [2022-04-15 11:17:25,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389408637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:25,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:25,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:25,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:25,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882011334] [2022-04-15 11:17:25,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882011334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:25,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:25,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:25,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114856963] [2022-04-15 11:17:25,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:25,612 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-15 11:17:25,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:25,612 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-15 11:17:25,629 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-15 11:17:25,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:25,629 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:26,356 INFO L93 Difference]: Finished difference Result 3277 states and 4953 transitions. [2022-04-15 11:17:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:26,357 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-15 11:17:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:26,357 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-15 11:17:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-15 11:17:26,358 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-15 11:17:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-15 11:17:26,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-15 11:17:26,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:26,590 INFO L225 Difference]: With dead ends: 3277 [2022-04-15 11:17:26,590 INFO L226 Difference]: Without dead ends: 1899 [2022-04-15 11:17:26,592 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-15 11:17:26,592 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:26,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-15 11:17:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-15 11:17:26,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:26,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,709 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,717 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:26,815 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-15 11:17:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-15 11:17:26,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:26,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:26,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1899 states. [2022-04-15 11:17:26,820 INFO L87 Difference]: Start difference. First operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1899 states. [2022-04-15 11:17:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:26,906 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-15 11:17:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-15 11:17:26,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:26,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:26,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:26,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2823 transitions. [2022-04-15 11:17:27,040 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2823 transitions. Word has length 26 [2022-04-15 11:17:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:27,040 INFO L478 AbstractCegarLoop]: Abstraction has 1897 states and 2823 transitions. [2022-04-15 11:17:27,040 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-15 11:17:27,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1897 states and 2823 transitions. [2022-04-15 11:17:29,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2823 edges. 2823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2823 transitions. [2022-04-15 11:17:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:29,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:29,737 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-15 11:17:29,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:17:29,737 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:29,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 1 times [2022-04-15 11:17:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:29,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506422630] [2022-04-15 11:17:29,737 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 2 times [2022-04-15 11:17:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:29,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823542057] [2022-04-15 11:17:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:29,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {61568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61562#true} is VALID [2022-04-15 11:17:29,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-15 11:17:29,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-15 11:17:29,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {61562#true} call ULTIMATE.init(); {61568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:29,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {61568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {61562#true} call #t~ret15 := main(); {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {61562#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {61562#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {61562#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {61562#true} assume !(0 != ~p1~0); {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {61562#true} assume !(0 != ~p2~0); {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {61562#true} assume !(0 != ~p3~0); {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {61562#true} assume !(0 != ~p4~0); {61562#true} is VALID [2022-04-15 11:17:29,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {61562#true} assume !(0 != ~p5~0); {61562#true} is VALID [2022-04-15 11:17:29,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {61562#true} assume 0 != ~p6~0;~lk6~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:29,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {61563#false} is VALID [2022-04-15 11:17:29,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {61563#false} assume 0 != ~p7~0; {61563#false} is VALID [2022-04-15 11:17:29,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {61563#false} assume 1 != ~lk7~0; {61563#false} is VALID [2022-04-15 11:17:29,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {61563#false} assume !false; {61563#false} is VALID [2022-04-15 11:17:29,788 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-15 11:17:29,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:29,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823542057] [2022-04-15 11:17:29,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823542057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:29,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:29,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:29,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:29,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506422630] [2022-04-15 11:17:29,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506422630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:29,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:29,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597051718] [2022-04-15 11:17:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:29,790 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-15 11:17:29,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:29,790 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-15 11:17:29,805 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-15 11:17:29,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:29,805 INFO L87 Difference]: Start difference. First operand 1897 states and 2823 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:30,428 INFO L93 Difference]: Finished difference Result 2845 states and 4217 transitions. [2022-04-15 11:17:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:30,428 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-15 11:17:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:30,429 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-15 11:17:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 11:17:30,429 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-15 11:17:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 11:17:30,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-15 11:17:30,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:30,681 INFO L225 Difference]: With dead ends: 2845 [2022-04-15 11:17:30,681 INFO L226 Difference]: Without dead ends: 1931 [2022-04-15 11:17:30,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-15 11:17:30,683 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:30,683 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 98 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-15 11:17:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-15 11:17:30,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:30,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,850 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,852 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:30,941 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-15 11:17:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-15 11:17:30,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:30,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:30,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-15 11:17:30,945 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-15 11:17:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:31,036 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-15 11:17:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-15 11:17:31,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:31,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:31,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:31,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2823 transitions. [2022-04-15 11:17:31,192 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2823 transitions. Word has length 27 [2022-04-15 11:17:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:31,192 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 2823 transitions. [2022-04-15 11:17:31,192 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-15 11:17:31,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 2823 transitions. [2022-04-15 11:17:33,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2823 edges. 2823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2823 transitions. [2022-04-15 11:17:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:33,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:33,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] [2022-04-15 11:17:33,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:17:33,785 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:33,785 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 1 times [2022-04-15 11:17:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:33,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277229221] [2022-04-15 11:17:33,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 2 times [2022-04-15 11:17:33,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:33,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088621165] [2022-04-15 11:17:33,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:33,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:33,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {74990#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {74984#true} is VALID [2022-04-15 11:17:33,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-15 11:17:33,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-15 11:17:33,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {74984#true} call ULTIMATE.init(); {74990#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:33,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {74990#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {74984#true} is VALID [2022-04-15 11:17:33,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-15 11:17:33,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-15 11:17:33,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {74984#true} call #t~ret15 := main(); {74984#true} is VALID [2022-04-15 11:17:33,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {74984#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {74984#true} is VALID [2022-04-15 11:17:33,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {74984#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {74984#true} is VALID [2022-04-15 11:17:33,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {74984#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {74984#true} is VALID [2022-04-15 11:17:33,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {74984#true} assume !(0 != ~p1~0); {74984#true} is VALID [2022-04-15 11:17:33,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {74984#true} assume !(0 != ~p2~0); {74984#true} is VALID [2022-04-15 11:17:33,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {74984#true} assume !(0 != ~p3~0); {74984#true} is VALID [2022-04-15 11:17:33,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {74984#true} assume !(0 != ~p4~0); {74984#true} is VALID [2022-04-15 11:17:33,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {74984#true} assume !(0 != ~p5~0); {74984#true} is VALID [2022-04-15 11:17:33,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {74984#true} assume !(0 != ~p6~0); {74984#true} is VALID [2022-04-15 11:17:33,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {74984#true} assume 0 != ~p7~0;~lk7~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p7~0; {74989#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:33,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {74989#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {74985#false} is VALID [2022-04-15 11:17:33,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {74985#false} assume !false; {74985#false} is VALID [2022-04-15 11:17:33,844 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-15 11:17:33,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088621165] [2022-04-15 11:17:33,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088621165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:33,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:33,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:33,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277229221] [2022-04-15 11:17:33,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277229221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:33,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:33,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:33,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514284589] [2022-04-15 11:17:33,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:33,845 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-15 11:17:33,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:33,845 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-15 11:17:33,861 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-15 11:17:33,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:33,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:33,862 INFO L87 Difference]: Start difference. First operand 1929 states and 2823 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:34,717 INFO L93 Difference]: Finished difference Result 3341 states and 4969 transitions. [2022-04-15 11:17:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:34,717 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-15 11:17:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:34,717 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-15 11:17:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-15 11:17:34,718 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-15 11:17:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-15 11:17:34,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-15 11:17:34,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:35,212 INFO L225 Difference]: With dead ends: 3341 [2022-04-15 11:17:35,212 INFO L226 Difference]: Without dead ends: 3339 [2022-04-15 11:17:35,212 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-15 11:17:35,213 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:35,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-15 11:17:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-15 11:17:35,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:35,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:35,407 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:35,409 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:35,700 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-15 11:17:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-15 11:17:35,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:35,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:35,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3339 states. [2022-04-15 11:17:35,708 INFO L87 Difference]: Start difference. First operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3339 states. [2022-04-15 11:17:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:35,995 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-15 11:17:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-15 11:17:35,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:35,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:35,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:35,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4007 transitions. [2022-04-15 11:17:36,339 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4007 transitions. Word has length 27 [2022-04-15 11:17:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:36,339 INFO L478 AbstractCegarLoop]: Abstraction has 2825 states and 4007 transitions. [2022-04-15 11:17:36,339 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-15 11:17:36,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2825 states and 4007 transitions. [2022-04-15 11:17:39,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4007 edges. 4007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4007 transitions. [2022-04-15 11:17:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:39,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:39,916 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-15 11:17:39,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:17:39,917 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 1 times [2022-04-15 11:17:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:39,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876429547] [2022-04-15 11:17:39,917 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 2 times [2022-04-15 11:17:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:39,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646834944] [2022-04-15 11:17:39,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:39,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:39,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {94012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {94006#true} is VALID [2022-04-15 11:17:39,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-15 11:17:39,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-15 11:17:39,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {94006#true} call ULTIMATE.init(); {94012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:39,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {94012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {94006#true} is VALID [2022-04-15 11:17:39,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-15 11:17:39,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-15 11:17:39,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {94006#true} call #t~ret15 := main(); {94006#true} is VALID [2022-04-15 11:17:39,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {94006#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {94006#true} is VALID [2022-04-15 11:17:39,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {94006#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {94006#true} is VALID [2022-04-15 11:17:39,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {94006#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {94006#true} is VALID [2022-04-15 11:17:39,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {94006#true} assume !(0 != ~p1~0); {94006#true} is VALID [2022-04-15 11:17:39,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {94006#true} assume !(0 != ~p2~0); {94006#true} is VALID [2022-04-15 11:17:39,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {94006#true} assume !(0 != ~p3~0); {94006#true} is VALID [2022-04-15 11:17:39,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {94006#true} assume !(0 != ~p4~0); {94006#true} is VALID [2022-04-15 11:17:39,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {94006#true} assume !(0 != ~p5~0); {94006#true} is VALID [2022-04-15 11:17:39,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {94006#true} assume !(0 != ~p6~0); {94006#true} is VALID [2022-04-15 11:17:39,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {94006#true} assume !(0 != ~p7~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p10~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p1~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p2~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p3~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p4~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p5~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p6~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:39,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p7~0; {94007#false} is VALID [2022-04-15 11:17:39,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {94007#false} assume 1 != ~lk7~0; {94007#false} is VALID [2022-04-15 11:17:39,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {94007#false} assume !false; {94007#false} is VALID [2022-04-15 11:17:39,973 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-15 11:17:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:39,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646834944] [2022-04-15 11:17:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646834944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:39,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:39,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:39,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876429547] [2022-04-15 11:17:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876429547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:39,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417223367] [2022-04-15 11:17:39,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:39,974 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-15 11:17:39,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:39,974 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-15 11:17:39,984 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-15 11:17:39,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:39,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:39,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:39,985 INFO L87 Difference]: Start difference. First operand 2825 states and 4007 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:42,283 INFO L93 Difference]: Finished difference Result 6477 states and 9193 transitions. [2022-04-15 11:17:42,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:42,283 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-15 11:17:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:42,284 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-15 11:17:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-15 11:17:42,285 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-15 11:17:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-15 11:17:42,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-15 11:17:42,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:42,917 INFO L225 Difference]: With dead ends: 6477 [2022-04-15 11:17:42,917 INFO L226 Difference]: Without dead ends: 3723 [2022-04-15 11:17:42,924 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-15 11:17:42,925 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:42,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-15 11:17:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-15 11:17:43,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:43,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:43,184 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:43,186 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:43,530 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-15 11:17:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-15 11:17:43,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:43,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:43,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-15 11:17:43,539 INFO L87 Difference]: Start difference. First operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-15 11:17:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:43,889 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-15 11:17:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-15 11:17:43,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:43,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:43,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:43,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5191 transitions. [2022-04-15 11:17:44,488 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5191 transitions. Word has length 27 [2022-04-15 11:17:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:44,488 INFO L478 AbstractCegarLoop]: Abstraction has 3721 states and 5191 transitions. [2022-04-15 11:17:44,489 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-15 11:17:44,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3721 states and 5191 transitions. [2022-04-15 11:17:49,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5191 edges. 5191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5191 transitions. [2022-04-15 11:17:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:49,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:49,270 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-15 11:17:49,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:17:49,270 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 1 times [2022-04-15 11:17:49,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:49,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456650642] [2022-04-15 11:17:49,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 2 times [2022-04-15 11:17:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:49,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469039544] [2022-04-15 11:17:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:49,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:49,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {121866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {121860#true} is VALID [2022-04-15 11:17:49,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-15 11:17:49,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-15 11:17:49,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {121860#true} call ULTIMATE.init(); {121866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:49,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {121866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {121860#true} call #t~ret15 := main(); {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {121860#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {121860#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {121860#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {121860#true} assume !(0 != ~p1~0); {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {121860#true} assume !(0 != ~p2~0); {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {121860#true} assume !(0 != ~p3~0); {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {121860#true} assume !(0 != ~p4~0); {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {121860#true} assume !(0 != ~p5~0); {121860#true} is VALID [2022-04-15 11:17:49,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {121860#true} assume !(0 != ~p6~0); {121860#true} is VALID [2022-04-15 11:17:49,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {121860#true} assume 0 != ~p7~0;~lk7~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {121865#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {121865#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:17:49,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {121861#false} is VALID [2022-04-15 11:17:49,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {121861#false} assume 0 != ~p8~0; {121861#false} is VALID [2022-04-15 11:17:49,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {121861#false} assume 1 != ~lk8~0; {121861#false} is VALID [2022-04-15 11:17:49,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {121861#false} assume !false; {121861#false} is VALID [2022-04-15 11:17:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:49,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469039544] [2022-04-15 11:17:49,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469039544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:49,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:49,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:49,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:49,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456650642] [2022-04-15 11:17:49,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456650642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:49,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:49,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:49,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682841532] [2022-04-15 11:17:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:49,329 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-15 11:17:49,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:49,329 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-15 11:17:49,343 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-15 11:17:49,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:49,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:49,344 INFO L87 Difference]: Start difference. First operand 3721 states and 5191 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:50,894 INFO L93 Difference]: Finished difference Result 5581 states and 7753 transitions. [2022-04-15 11:17:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:50,895 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-15 11:17:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:50,895 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-15 11:17:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-15 11:17:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-15 11:17:50,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-15 11:17:50,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:51,546 INFO L225 Difference]: With dead ends: 5581 [2022-04-15 11:17:51,546 INFO L226 Difference]: Without dead ends: 3787 [2022-04-15 11:17:51,549 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-15 11:17:51,549 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:51,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-15 11:17:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-15 11:17:51,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:51,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:51,817 INFO L74 IsIncluded]: Start isIncluded. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:51,819 INFO L87 Difference]: Start difference. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:52,179 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-15 11:17:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-15 11:17:52,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:52,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:52,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3787 states. [2022-04-15 11:17:52,188 INFO L87 Difference]: Start difference. First operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3787 states. [2022-04-15 11:17:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:52,550 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-15 11:17:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-15 11:17:52,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:52,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:52,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:52,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5191 transitions. [2022-04-15 11:17:53,163 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5191 transitions. Word has length 28 [2022-04-15 11:17:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:53,163 INFO L478 AbstractCegarLoop]: Abstraction has 3785 states and 5191 transitions. [2022-04-15 11:17:53,163 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-15 11:17:53,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3785 states and 5191 transitions. [2022-04-15 11:17:57,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5191 edges. 5191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5191 transitions. [2022-04-15 11:17:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:57,713 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:57,713 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-15 11:17:57,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:17:57,714 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 1 times [2022-04-15 11:17:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:57,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113571428] [2022-04-15 11:17:57,719 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 2 times [2022-04-15 11:17:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:57,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451642196] [2022-04-15 11:17:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:57,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:57,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {148184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {148178#true} is VALID [2022-04-15 11:17:57,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-15 11:17:57,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-15 11:17:57,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {148178#true} call ULTIMATE.init(); {148184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {148184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {148178#true} call #t~ret15 := main(); {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {148178#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {148178#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {148178#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {148178#true} assume !(0 != ~p1~0); {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {148178#true} assume !(0 != ~p2~0); {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {148178#true} assume !(0 != ~p3~0); {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {148178#true} assume !(0 != ~p4~0); {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {148178#true} assume !(0 != ~p5~0); {148178#true} is VALID [2022-04-15 11:17:57,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {148178#true} assume !(0 != ~p6~0); {148178#true} is VALID [2022-04-15 11:17:57,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {148178#true} assume !(0 != ~p7~0); {148178#true} is VALID [2022-04-15 11:17:57,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {148178#true} assume 0 != ~p8~0;~lk8~0 := 1; {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {148183#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {148183#(= main_~lk8~0 1)} assume 0 != ~p8~0; {148183#(= main_~lk8~0 1)} is VALID [2022-04-15 11:17:57,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {148183#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {148179#false} is VALID [2022-04-15 11:17:57,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {148179#false} assume !false; {148179#false} is VALID [2022-04-15 11:17:57,757 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-15 11:17:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:57,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451642196] [2022-04-15 11:17:57,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451642196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:57,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:57,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:57,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:57,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113571428] [2022-04-15 11:17:57,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113571428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:57,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:57,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437955767] [2022-04-15 11:17:57,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:57,758 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-15 11:17:57,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:57,758 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-15 11:17:57,770 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-15 11:17:57,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:57,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:57,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:57,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:57,771 INFO L87 Difference]: Start difference. First operand 3785 states and 5191 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:00,071 INFO L93 Difference]: Finished difference Result 6413 states and 8905 transitions. [2022-04-15 11:18:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:00,072 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-15 11:18:00,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:00,072 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-15 11:18:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 11:18:00,073 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-15 11:18:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 11:18:00,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 11:18:00,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:01,803 INFO L225 Difference]: With dead ends: 6413 [2022-04-15 11:18:01,803 INFO L226 Difference]: Without dead ends: 6411 [2022-04-15 11:18:01,804 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-15 11:18:01,805 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:01,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-15 11:18:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-15 11:18:02,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:02,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:02,220 INFO L74 IsIncluded]: Start isIncluded. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:02,222 INFO L87 Difference]: Start difference. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:03,287 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-15 11:18:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-15 11:18:03,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:03,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:03,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6411 states. [2022-04-15 11:18:03,301 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6411 states. [2022-04-15 11:18:04,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:04,405 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-15 11:18:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-15 11:18:04,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:04,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:04,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:04,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7495 transitions. [2022-04-15 11:18:05,690 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7495 transitions. Word has length 28 [2022-04-15 11:18:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:05,690 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 7495 transitions. [2022-04-15 11:18:05,691 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-15 11:18:05,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 7495 transitions. [2022-04-15 11:18:12,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7495 transitions. [2022-04-15 11:18:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:18:12,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:12,974 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-15 11:18:12,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:18:12,974 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:12,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 1 times [2022-04-15 11:18:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:12,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398944270] [2022-04-15 11:18:12,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:12,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 2 times [2022-04-15 11:18:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:12,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171379230] [2022-04-15 11:18:12,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:12,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:13,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {185126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {185120#true} is VALID [2022-04-15 11:18:13,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-15 11:18:13,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-15 11:18:13,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {185120#true} call ULTIMATE.init(); {185126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:13,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {185126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {185120#true} call #t~ret15 := main(); {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {185120#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {185120#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {185120#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {185120#true} assume !(0 != ~p1~0); {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {185120#true} assume !(0 != ~p2~0); {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {185120#true} assume !(0 != ~p3~0); {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {185120#true} assume !(0 != ~p4~0); {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {185120#true} assume !(0 != ~p5~0); {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {185120#true} assume !(0 != ~p6~0); {185120#true} is VALID [2022-04-15 11:18:13,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {185120#true} assume !(0 != ~p7~0); {185120#true} is VALID [2022-04-15 11:18:13,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {185120#true} assume !(0 != ~p8~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {185125#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p10~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p1~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p2~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p3~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p4~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p5~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p6~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p7~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:13,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {185125#(= main_~p8~0 0)} assume 0 != ~p8~0; {185121#false} is VALID [2022-04-15 11:18:13,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {185121#false} assume 1 != ~lk8~0; {185121#false} is VALID [2022-04-15 11:18:13,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {185121#false} assume !false; {185121#false} is VALID [2022-04-15 11:18:13,045 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-15 11:18:13,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:13,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171379230] [2022-04-15 11:18:13,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171379230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:13,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:13,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:13,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:13,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398944270] [2022-04-15 11:18:13,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398944270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:13,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:13,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392990247] [2022-04-15 11:18:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:13,046 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-15 11:18:13,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:13,047 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-15 11:18:13,058 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-15 11:18:13,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:13,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:13,059 INFO L87 Difference]: Start difference. First operand 5641 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:20,407 INFO L93 Difference]: Finished difference Result 12813 states and 16969 transitions. [2022-04-15 11:18:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:20,407 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-15 11:18:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:20,407 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-15 11:18:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 11:18:20,408 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-15 11:18:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 11:18:20,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-15 11:18:20,504 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-15 11:18:22,604 INFO L225 Difference]: With dead ends: 12813 [2022-04-15 11:18:22,604 INFO L226 Difference]: Without dead ends: 7307 [2022-04-15 11:18:22,609 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-15 11:18:22,610 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:22,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-15 11:18:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-15 11:18:23,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:23,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,158 INFO L74 IsIncluded]: Start isIncluded. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:23,164 INFO L87 Difference]: Start difference. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,547 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-15 11:18:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-15 11:18:24,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:24,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:24,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7307 states. [2022-04-15 11:18:24,565 INFO L87 Difference]: Start difference. First operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7307 states. [2022-04-15 11:18:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,966 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-15 11:18:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-15 11:18:25,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:25,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9479 transitions. [2022-04-15 11:18:28,232 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9479 transitions. Word has length 28 [2022-04-15 11:18:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:28,232 INFO L478 AbstractCegarLoop]: Abstraction has 7305 states and 9479 transitions. [2022-04-15 11:18:28,232 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-15 11:18:28,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7305 states and 9479 transitions. [2022-04-15 11:18:38,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9479 edges. 9479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9479 transitions. [2022-04-15 11:18:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:18:38,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:38,148 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-15 11:18:38,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:18:38,148 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 1 times [2022-04-15 11:18:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [656845755] [2022-04-15 11:18:38,149 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 2 times [2022-04-15 11:18:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740188213] [2022-04-15 11:18:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:38,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {239988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {239982#true} is VALID [2022-04-15 11:18:38,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-15 11:18:38,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-15 11:18:38,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {239982#true} call ULTIMATE.init(); {239988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {239988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {239982#true} call #t~ret15 := main(); {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {239982#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {239982#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {239982#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {239982#true} assume !(0 != ~p1~0); {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {239982#true} assume !(0 != ~p2~0); {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {239982#true} assume !(0 != ~p3~0); {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {239982#true} assume !(0 != ~p4~0); {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {239982#true} assume !(0 != ~p5~0); {239982#true} is VALID [2022-04-15 11:18:38,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {239982#true} assume !(0 != ~p6~0); {239982#true} is VALID [2022-04-15 11:18:38,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {239982#true} assume !(0 != ~p7~0); {239982#true} is VALID [2022-04-15 11:18:38,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {239982#true} assume 0 != ~p8~0;~lk8~0 := 1; {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {239987#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:18:38,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {239983#false} is VALID [2022-04-15 11:18:38,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {239983#false} assume 0 != ~p9~0; {239983#false} is VALID [2022-04-15 11:18:38,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {239983#false} assume 1 != ~lk9~0; {239983#false} is VALID [2022-04-15 11:18:38,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {239983#false} assume !false; {239983#false} is VALID [2022-04-15 11:18:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:38,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:38,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740188213] [2022-04-15 11:18:38,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740188213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:38,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:38,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:38,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:38,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [656845755] [2022-04-15 11:18:38,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [656845755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:38,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:38,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917342623] [2022-04-15 11:18:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:38,223 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-15 11:18:38,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:38,223 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-15 11:18:38,246 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-15 11:18:38,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:38,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:38,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:38,246 INFO L87 Difference]: Start difference. First operand 7305 states and 9479 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:43,427 INFO L93 Difference]: Finished difference Result 10957 states and 14153 transitions. [2022-04-15 11:18:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:43,427 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-15 11:18:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:43,427 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-15 11:18:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-15 11:18:43,428 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-15 11:18:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-15 11:18:43,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-15 11:18:43,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:45,827 INFO L225 Difference]: With dead ends: 10957 [2022-04-15 11:18:45,827 INFO L226 Difference]: Without dead ends: 7435 [2022-04-15 11:18:45,831 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-15 11:18:45,831 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:45,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-15 11:18:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-15 11:18:46,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:46,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,435 INFO L74 IsIncluded]: Start isIncluded. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,442 INFO L87 Difference]: Start difference. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:47,780 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-15 11:18:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-15 11:18:47,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:47,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:47,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7435 states. [2022-04-15 11:18:47,801 INFO L87 Difference]: Start difference. First operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7435 states. [2022-04-15 11:18:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:49,130 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-15 11:18:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-15 11:18:49,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:49,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:49,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:49,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9479 transitions. [2022-04-15 11:18:51,435 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9479 transitions. Word has length 29 [2022-04-15 11:18:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:51,435 INFO L478 AbstractCegarLoop]: Abstraction has 7433 states and 9479 transitions. [2022-04-15 11:18:51,435 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-15 11:18:51,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7433 states and 9479 transitions. [2022-04-15 11:19:00,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9479 edges. 9479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9479 transitions. [2022-04-15 11:19:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:19:00,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:00,083 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-15 11:19:00,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:19:00,084 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 1 times [2022-04-15 11:19:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:00,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100834799] [2022-04-15 11:19:00,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 2 times [2022-04-15 11:19:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:00,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041654244] [2022-04-15 11:19:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:00,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:00,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {291650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {291644#true} is VALID [2022-04-15 11:19:00,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-15 11:19:00,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-15 11:19:00,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {291644#true} call ULTIMATE.init(); {291650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:00,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {291650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {291644#true} is VALID [2022-04-15 11:19:00,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-15 11:19:00,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-15 11:19:00,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {291644#true} call #t~ret15 := main(); {291644#true} is VALID [2022-04-15 11:19:00,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {291644#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {291644#true} is VALID [2022-04-15 11:19:00,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {291644#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {291644#true} is VALID [2022-04-15 11:19:00,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {291644#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {291644#true} is VALID [2022-04-15 11:19:00,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {291644#true} assume !(0 != ~p1~0); {291644#true} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {291644#true} assume !(0 != ~p2~0); {291644#true} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {291644#true} assume !(0 != ~p3~0); {291644#true} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {291644#true} assume !(0 != ~p4~0); {291644#true} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {291644#true} assume !(0 != ~p5~0); {291644#true} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {291644#true} assume !(0 != ~p6~0); {291644#true} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {291644#true} assume !(0 != ~p7~0); {291644#true} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {291644#true} assume !(0 != ~p8~0); {291644#true} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {291644#true} assume 0 != ~p9~0;~lk9~0 := 1; {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {291649#(= main_~lk9~0 1)} assume 0 != ~p9~0; {291649#(= main_~lk9~0 1)} is VALID [2022-04-15 11:19:00,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {291649#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {291645#false} is VALID [2022-04-15 11:19:00,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {291645#false} assume !false; {291645#false} is VALID [2022-04-15 11:19:00,127 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-15 11:19:00,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:00,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041654244] [2022-04-15 11:19:00,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041654244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:00,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:00,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:00,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:00,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100834799] [2022-04-15 11:19:00,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100834799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:00,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:00,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764504878] [2022-04-15 11:19:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:00,128 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-15 11:19:00,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:00,128 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-15 11:19:00,141 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-15 11:19:00,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:00,142 INFO L87 Difference]: Start difference. First operand 7433 states and 9479 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:07,545 INFO L93 Difference]: Finished difference Result 12301 states and 15753 transitions. [2022-04-15 11:19:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:07,545 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-15 11:19:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:07,545 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-15 11:19:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 11:19:07,546 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-15 11:19:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 11:19:07,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-15 11:19:07,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:13,875 INFO L225 Difference]: With dead ends: 12301 [2022-04-15 11:19:13,876 INFO L226 Difference]: Without dead ends: 12299 [2022-04-15 11:19:13,877 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-15 11:19:13,878 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:13,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-15 11:19:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-15 11:19:14,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:14,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:14,770 INFO L74 IsIncluded]: Start isIncluded. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:14,784 INFO L87 Difference]: Start difference. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:18,870 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-15 11:19:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-15 11:19:18,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:18,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:18,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12299 states. [2022-04-15 11:19:18,908 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12299 states. [2022-04-15 11:19:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:22,695 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-15 11:19:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-15 11:19:22,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:22,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:22,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:22,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13959 transitions. [2022-04-15 11:19:27,661 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13959 transitions. Word has length 29 [2022-04-15 11:19:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:27,662 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 13959 transitions. [2022-04-15 11:19:27,662 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-15 11:19:27,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 13959 transitions. [2022-04-15 11:19:42,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13959 edges. 13959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13959 transitions. [2022-04-15 11:19:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:19:42,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:42,279 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-15 11:19:42,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:19:42,279 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 1 times [2022-04-15 11:19:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:42,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [860125281] [2022-04-15 11:19:42,282 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 2 times [2022-04-15 11:19:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:42,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461827933] [2022-04-15 11:19:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:42,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:42,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {363408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {363402#true} is VALID [2022-04-15 11:19:42,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-15 11:19:42,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-15 11:19:42,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {363402#true} call ULTIMATE.init(); {363408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:42,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {363408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {363402#true} is VALID [2022-04-15 11:19:42,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {363402#true} call #t~ret15 := main(); {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {363402#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {363402#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {363402#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {363402#true} assume !(0 != ~p1~0); {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {363402#true} assume !(0 != ~p2~0); {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {363402#true} assume !(0 != ~p3~0); {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {363402#true} assume !(0 != ~p4~0); {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {363402#true} assume !(0 != ~p5~0); {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {363402#true} assume !(0 != ~p6~0); {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {363402#true} assume !(0 != ~p7~0); {363402#true} is VALID [2022-04-15 11:19:42,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {363402#true} assume !(0 != ~p8~0); {363402#true} is VALID [2022-04-15 11:19:42,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {363402#true} assume !(0 != ~p9~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p10~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p1~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p2~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p3~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p4~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p5~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p6~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p7~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p8~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-15 11:19:42,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {363407#(= main_~p9~0 0)} assume 0 != ~p9~0; {363403#false} is VALID [2022-04-15 11:19:42,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {363403#false} assume 1 != ~lk9~0; {363403#false} is VALID [2022-04-15 11:19:42,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {363403#false} assume !false; {363403#false} is VALID [2022-04-15 11:19:42,336 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-15 11:19:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:42,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461827933] [2022-04-15 11:19:42,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461827933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:42,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:42,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:42,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:42,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [860125281] [2022-04-15 11:19:42,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [860125281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:42,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:42,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501524411] [2022-04-15 11:19:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:42,337 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-15 11:19:42,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:42,337 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-15 11:19:42,352 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-15 11:19:42,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:42,353 INFO L87 Difference]: Start difference. First operand 11273 states and 13959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:13,577 INFO L93 Difference]: Finished difference Result 25357 states and 31113 transitions. [2022-04-15 11:20:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:20:13,578 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-15 11:20:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:20:13,578 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-15 11:20:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-15 11:20:13,579 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-15 11:20:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-15 11:20:13,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-15 11:20:13,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:22,124 INFO L225 Difference]: With dead ends: 25357 [2022-04-15 11:20:22,124 INFO L226 Difference]: Without dead ends: 14347 [2022-04-15 11:20:22,136 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-15 11:20:22,137 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:20:22,137 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:20:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-15 11:20:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-15 11:20:23,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:20:23,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:23,289 INFO L74 IsIncluded]: Start isIncluded. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:23,304 INFO L87 Difference]: Start difference. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:28,753 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-15 11:20:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-15 11:20:28,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:28,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:28,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14347 states. [2022-04-15 11:20:28,791 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14347 states. [2022-04-15 11:20:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:33,913 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-15 11:20:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-15 11:20:33,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:33,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:33,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:33,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 17159 transitions. [2022-04-15 11:20:42,612 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 17159 transitions. Word has length 29 [2022-04-15 11:20:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:42,626 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 17159 transitions. [2022-04-15 11:20:42,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:42,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 17159 transitions. [2022-04-15 11:20:59,610 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-15 11:20:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 17159 transitions. [2022-04-15 11:20:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:20:59,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:20:59,619 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-15 11:20:59,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:20:59,619 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:20:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:20:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 1 times [2022-04-15 11:20:59,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:59,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1763727469] [2022-04-15 11:20:59,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:20:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 2 times [2022-04-15 11:20:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:20:59,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476275869] [2022-04-15 11:20:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:20:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:20:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:59,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:20:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:59,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {471518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {471512#true} is VALID [2022-04-15 11:20:59,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-15 11:20:59,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {471512#true} call ULTIMATE.init(); {471518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:20:59,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {471518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {471512#true} call #t~ret15 := main(); {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {471512#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {471512#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {471512#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {471512#true} assume !(0 != ~p1~0); {471512#true} is VALID [2022-04-15 11:20:59,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {471512#true} assume !(0 != ~p2~0); {471512#true} is VALID [2022-04-15 11:20:59,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {471512#true} assume !(0 != ~p3~0); {471512#true} is VALID [2022-04-15 11:20:59,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {471512#true} assume !(0 != ~p4~0); {471512#true} is VALID [2022-04-15 11:20:59,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {471512#true} assume !(0 != ~p5~0); {471512#true} is VALID [2022-04-15 11:20:59,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {471512#true} assume !(0 != ~p6~0); {471512#true} is VALID [2022-04-15 11:20:59,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {471512#true} assume !(0 != ~p7~0); {471512#true} is VALID [2022-04-15 11:20:59,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {471512#true} assume !(0 != ~p8~0); {471512#true} is VALID [2022-04-15 11:20:59,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {471512#true} assume 0 != ~p9~0;~lk9~0 := 1; {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:20:59,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {471513#false} is VALID [2022-04-15 11:20:59,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {471513#false} assume 0 != ~p10~0; {471513#false} is VALID [2022-04-15 11:20:59,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {471513#false} assume 1 != ~lk10~0; {471513#false} is VALID [2022-04-15 11:20:59,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {471513#false} assume !false; {471513#false} is VALID [2022-04-15 11:20:59,680 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-15 11:20:59,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:20:59,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476275869] [2022-04-15 11:20:59,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476275869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:59,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:59,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:59,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:20:59,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1763727469] [2022-04-15 11:20:59,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1763727469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:59,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:59,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:59,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945885774] [2022-04-15 11:20:59,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:20:59,681 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-15 11:20:59,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:20:59,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:59,697 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-15 11:20:59,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:20:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:20:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:20:59,698 INFO L87 Difference]: Start difference. First operand 14345 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:19,570 INFO L93 Difference]: Finished difference Result 21517 states and 25609 transitions. [2022-04-15 11:21:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:21:19,570 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-15 11:21:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:21:19,571 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-15 11:21:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 11:21:19,571 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-15 11:21:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 11:21:19,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 11:21:19,674 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-15 11:21:28,370 INFO L225 Difference]: With dead ends: 21517 [2022-04-15 11:21:28,370 INFO L226 Difference]: Without dead ends: 14603 [2022-04-15 11:21:28,379 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-15 11:21:28,379 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:21:28,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:21:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-15 11:21:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-15 11:21:29,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:21:29,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:29,514 INFO L74 IsIncluded]: Start isIncluded. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:29,526 INFO L87 Difference]: Start difference. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:34,584 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-15 11:21:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-15 11:21:34,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:21:34,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:21:34,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14603 states. [2022-04-15 11:21:34,618 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14603 states. [2022-04-15 11:21:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:39,612 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-15 11:21:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-15 11:21:39,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:21:39,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:21:39,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:21:39,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:21:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 17159 transitions. [2022-04-15 11:21:48,555 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 17159 transitions. Word has length 30 [2022-04-15 11:21:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:21:48,555 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 17159 transitions. [2022-04-15 11:21:48,555 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-15 11:21:48,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 17159 transitions. [2022-04-15 11:22:06,686 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-15 11:22:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 17159 transitions. [2022-04-15 11:22:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:22:06,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:22:06,702 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-15 11:22:06,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:22:06,703 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:22:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:22:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 1 times [2022-04-15 11:22:06,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:22:06,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1791074737] [2022-04-15 11:22:06,703 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:22:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 2 times [2022-04-15 11:22:06,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:22:06,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220686781] [2022-04-15 11:22:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:22:06,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:22:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:22:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:06,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {572972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {572966#true} is VALID [2022-04-15 11:22:06,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-15 11:22:06,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-15 11:22:06,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {572966#true} call ULTIMATE.init(); {572972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:22:06,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {572972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {572966#true} is VALID [2022-04-15 11:22:06,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {572966#true} call #t~ret15 := main(); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {572966#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {572966#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {572966#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {572966#true} assume !(0 != ~p1~0); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {572966#true} assume !(0 != ~p2~0); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {572966#true} assume !(0 != ~p3~0); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {572966#true} assume !(0 != ~p4~0); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {572966#true} assume !(0 != ~p5~0); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {572966#true} assume !(0 != ~p6~0); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {572966#true} assume !(0 != ~p7~0); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {572966#true} assume !(0 != ~p8~0); {572966#true} is VALID [2022-04-15 11:22:06,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {572966#true} assume !(0 != ~p9~0); {572966#true} is VALID [2022-04-15 11:22:06,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {572966#true} assume !(0 != ~p10~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p1~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p2~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p3~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p4~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p5~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p6~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p7~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p8~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p9~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-15 11:22:06,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {572971#(= main_~p10~0 0)} assume 0 != ~p10~0; {572967#false} is VALID [2022-04-15 11:22:06,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {572967#false} assume 1 != ~lk10~0; {572967#false} is VALID [2022-04-15 11:22:06,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {572967#false} assume !false; {572967#false} is VALID [2022-04-15 11:22:06,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-15 11:22:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:22:06,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220686781] [2022-04-15 11:22:06,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220686781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:22:06,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:22:06,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:22:06,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:22:06,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1791074737] [2022-04-15 11:22:06,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1791074737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:22:06,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:22:06,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:22:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135961438] [2022-04-15 11:22:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:22:06,744 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-15 11:22:06,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:22:06,744 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-15 11:22:06,761 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-15 11:22:06,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:22:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:22:06,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:22:06,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:22:06,762 INFO L87 Difference]: Start difference. First operand 14601 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:24:40,158 INFO L93 Difference]: Finished difference Result 42251 states and 48392 transitions. [2022-04-15 11:24:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:24:40,159 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-15 11:24:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:24:40,159 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-15 11:24:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-15 11:24:40,160 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-15 11:24:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-15 11:24:40,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-15 11:24:40,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:49,316 INFO L225 Difference]: With dead ends: 42251 [2022-04-15 11:24:49,316 INFO L226 Difference]: Without dead ends: 14601 [2022-04-15 11:24:49,347 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-15 11:24:49,351 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:24:49,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:24:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2022-04-15 11:24:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14601. [2022-04-15 11:24:50,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:24:50,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:50,562 INFO L74 IsIncluded]: Start isIncluded. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:50,578 INFO L87 Difference]: Start difference. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:24:56,202 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-15 11:24:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-15 11:24:56,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:24:56,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:24:56,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14601 states. [2022-04-15 11:24:56,242 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14601 states. [2022-04-15 11:25:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:01,585 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-15 11:25:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-15 11:25:01,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:25:01,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:25:01,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:25:01,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:25:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16135 transitions. [2022-04-15 11:25:10,578 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16135 transitions. Word has length 30 [2022-04-15 11:25:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:25:10,579 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 16135 transitions. [2022-04-15 11:25:10,579 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-15 11:25:10,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 16135 transitions. [2022-04-15 11:25:26,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16135 edges. 16135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:25:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-15 11:25:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:25:26,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:25:26,120 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-15 11:25:26,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:25:26,120 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:25:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:25:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 1 times [2022-04-15 11:25:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:25:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [283507594] [2022-04-15 11:25:26,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:25:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 2 times [2022-04-15 11:25:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:25:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054635091] [2022-04-15 11:25:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:25:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:25:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:25:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:25:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:25:26,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {715890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {715884#true} is VALID [2022-04-15 11:25:26,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-15 11:25:26,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {715884#true} call ULTIMATE.init(); {715890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {715890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {715884#true} call #t~ret15 := main(); {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {715884#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {715884#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {715884#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {715884#true} assume !(0 != ~p1~0); {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {715884#true} assume !(0 != ~p2~0); {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {715884#true} assume !(0 != ~p3~0); {715884#true} is VALID [2022-04-15 11:25:26,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {715884#true} assume !(0 != ~p4~0); {715884#true} is VALID [2022-04-15 11:25:26,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {715884#true} assume !(0 != ~p5~0); {715884#true} is VALID [2022-04-15 11:25:26,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {715884#true} assume !(0 != ~p6~0); {715884#true} is VALID [2022-04-15 11:25:26,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {715884#true} assume !(0 != ~p7~0); {715884#true} is VALID [2022-04-15 11:25:26,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {715884#true} assume !(0 != ~p8~0); {715884#true} is VALID [2022-04-15 11:25:26,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {715884#true} assume !(0 != ~p9~0); {715884#true} is VALID [2022-04-15 11:25:26,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {715884#true} assume 0 != ~p10~0;~lk10~0 := 1; {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {715889#(= main_~lk10~0 1)} assume 0 != ~p10~0; {715889#(= main_~lk10~0 1)} is VALID [2022-04-15 11:25:26,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {715889#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {715885#false} is VALID [2022-04-15 11:25:26,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {715885#false} assume !false; {715885#false} is VALID [2022-04-15 11:25:26,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-15 11:25:26,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:25:26,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054635091] [2022-04-15 11:25:26,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054635091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:25:26,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:25:26,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:25:26,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:25:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [283507594] [2022-04-15 11:25:26,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [283507594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:25:26,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:25:26,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:25:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590939971] [2022-04-15 11:25:26,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:25:26,169 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-15 11:25:26,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:25:26,169 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-15 11:25:26,186 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-15 11:25:26,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:25:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:25:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:25:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:25:26,187 INFO L87 Difference]: Start difference. First operand 14601 states and 16135 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:36,511 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-15 11:25:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:25:36,512 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-15 11:25:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:25:36,512 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-15 11:25:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 11:25:36,512 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-15 11:25:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 11:25:36,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-15 11:25:36,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:25:36,551 INFO L225 Difference]: With dead ends: 14601 [2022-04-15 11:25:36,551 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 11:25:36,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:25:36,565 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:25:36,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 62 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:25:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 11:25:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 11:25:36,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:25:36,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 11:25:36,566 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 11:25:36,566 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 11:25:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:36,566 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:25:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:25:36,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:25:36,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:25:36,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 11:25:36,566 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 11:25:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:36,567 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:25:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:25:36,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:25:36,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:25:36,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:25:36,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:25:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 11:25:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 11:25:36,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-15 11:25:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:25:36,567 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 11:25:36,567 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-15 11:25:36,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 11:25:36,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:25:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:25:36,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:25:36,570 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:25:36,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:25:36,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 11:26:06,272 WARN L232 SmtUtils]: Spent 29.65s on a formula simplification that was a NOOP. DAG size: 1333 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 11:27:07,703 WARN L232 SmtUtils]: Spent 1.02m on a formula simplification that was a NOOP. DAG size: 1174 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 11:29:15,982 WARN L232 SmtUtils]: Spent 2.14m on a formula simplification that was a NOOP. DAG size: 2614 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 11:29:22,851 WARN L232 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 570 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 11:30:14,134 WARN L232 SmtUtils]: Spent 51.28s on a formula simplification that was a NOOP. DAG size: 1126 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 11:30:33,823 WARN L232 SmtUtils]: Spent 19.68s on a formula simplification that was a NOOP. DAG size: 1081 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 11:30:56,580 WARN L232 SmtUtils]: Spent 22.75s on a formula simplification that was a NOOP. DAG size: 950 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 11:31:09,514 WARN L232 SmtUtils]: Spent 12.93s on a formula simplification that was a NOOP. DAG size: 1061 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)