/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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:17:08,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:17:08,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:17:08,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:17:08,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:17:08,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:17:08,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:17:08,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:17:08,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:17:08,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:17:08,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:17:08,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:17:08,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:17:08,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:17:08,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:17:08,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:17:08,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:17:08,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:17:08,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:17:08,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:17:08,938 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:17:08,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:17:08,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:17:08,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:17:08,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:17:08,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:17:08,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:17:08,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:17:08,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:17:08,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:17:08,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:17:08,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:17:08,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:17:08,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:17:08,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:17:08,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:17:08,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:17:08,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:17:08,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:17:08,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:17:08,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:17:08,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:17:08,966 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:08,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:17:08,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:17:08,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:17:08,981 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:17:08,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:17:08,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:17:08,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:17:08,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:17:08,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:17:08,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:17:08,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:17:08,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:17:08,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:17:08,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:17:08,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:17:08,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:17:08,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:17:08,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:17:08,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:17:08,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:17:08,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:17:08,984 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:17:08,984 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:17:08,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:17:08,984 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:17:08,984 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:09,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:17:09,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:17:09,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:17:09,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:17:09,248 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:17:09,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2022-04-15 11:17:09,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a97e7d1e/326e9026f0ac43938b9b8b0fd53e74d3/FLAG941ab605f [2022-04-15 11:17:09,741 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:17:09,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2022-04-15 11:17:09,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a97e7d1e/326e9026f0ac43938b9b8b0fd53e74d3/FLAG941ab605f [2022-04-15 11:17:09,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a97e7d1e/326e9026f0ac43938b9b8b0fd53e74d3 [2022-04-15 11:17:09,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:17:09,772 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:17:09,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:17:09,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:17:09,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:17:09,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc3e386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:09, skipping insertion in model container [2022-04-15 11:17:09,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:17:09" (1/1) ... [2022-04-15 11:17:09,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:17:09,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:17:10,036 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_13.c[4936,4949] [2022-04-15 11:17:10,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:17:10,057 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:17:10,096 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_13.c[4936,4949] [2022-04-15 11:17:10,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:17:10,110 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:17:10,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:10 WrapperNode [2022-04-15 11:17:10,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:17:10,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:17:10,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:17:10,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:17:10,121 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:10" (1/1) ... [2022-04-15 11:17:10,121 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:10" (1/1) ... [2022-04-15 11:17:10,136 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:10" (1/1) ... [2022-04-15 11:17:10,137 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:10" (1/1) ... [2022-04-15 11:17:10,150 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:10" (1/1) ... [2022-04-15 11:17:10,157 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:10" (1/1) ... [2022-04-15 11:17:10,158 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:10" (1/1) ... [2022-04-15 11:17:10,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:17:10,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:17:10,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:17:10,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:17:10,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:10" (1/1) ... [2022-04-15 11:17:10,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:17:10,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:17:10,200 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:10,219 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:10,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:17:10,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:17:10,241 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:17:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:17:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:17:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:17:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:17:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:17:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:17:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:17:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:17:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:17:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:17:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:17:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:17:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:17:10,316 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:17:10,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:17:10,588 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:17:10,598 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:17:10,598 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:17:10,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:17:10 BoogieIcfgContainer [2022-04-15 11:17:10,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:17:10,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:17:10,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:17:10,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:17:10,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:17:09" (1/3) ... [2022-04-15 11:17:10,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec570f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:17:10, skipping insertion in model container [2022-04-15 11:17:10,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:10" (2/3) ... [2022-04-15 11:17:10,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec570f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:17:10, skipping insertion in model container [2022-04-15 11:17:10,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:17:10" (3/3) ... [2022-04-15 11:17:10,608 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-04-15 11:17:10,612 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:17:10,612 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:17:10,655 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:17:10,662 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:10,662 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:17:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 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:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:17:10,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:10,688 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:10,689 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 1 times [2022-04-15 11:17:10,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:10,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112908760] [2022-04-15 11:17:10,710 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 2 times [2022-04-15 11:17:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:10,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129045560] [2022-04-15 11:17:10,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:10,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:11,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {57#true} is VALID [2022-04-15 11:17:11,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-15 11:17:11,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-15 11:17:11,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:11,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {57#true} is VALID [2022-04-15 11:17:11,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-15 11:17:11,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-15 11:17:11,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID [2022-04-15 11:17:11,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {57#true} is VALID [2022-04-15 11:17:11,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {57#true} is VALID [2022-04-15 11:17:11,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {57#true} is VALID [2022-04-15 11:17:11,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume 0 != ~p1~0;~lk1~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p1~0; {62#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:11,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {62#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {58#false} is VALID [2022-04-15 11:17:11,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-04-15 11:17:11,022 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,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:11,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129045560] [2022-04-15 11:17:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129045560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:11,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:11,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:11,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:11,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112908760] [2022-04-15 11:17:11,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112908760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:11,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:11,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:11,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363707849] [2022-04-15 11:17:11,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:11,039 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:11,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:11,044 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:11,083 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:11,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:11,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:11,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:11,109 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.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:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,547 INFO L93 Difference]: Finished difference Result 106 states and 187 transitions. [2022-04-15 11:17:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:11,548 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:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:11,549 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:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 11:17:11,566 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:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 11:17:11,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-15 11:17:11,742 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:11,755 INFO L225 Difference]: With dead ends: 106 [2022-04-15 11:17:11,755 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 11:17:11,757 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,761 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:11,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 107 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 11:17:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2022-04-15 11:17:11,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:11,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states 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,808 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states 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,810 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states 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,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,819 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-15 11:17:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-15 11:17:11,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:11,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:11,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 11:17:11,822 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 11:17:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:11,839 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-15 11:17:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-15 11:17:11,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:11,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:11,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:11,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states 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,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2022-04-15 11:17:11,848 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2022-04-15 11:17:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:11,848 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2022-04-15 11:17:11,848 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:11,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 114 transitions. [2022-04-15 11:17:11,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2022-04-15 11:17:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:17:11,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:11,979 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:11,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:17:11,980 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 1 times [2022-04-15 11:17:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:11,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309284272] [2022-04-15 11:17:11,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 2 times [2022-04-15 11:17:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:11,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231365847] [2022-04-15 11:17:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {589#true} is VALID [2022-04-15 11:17:12,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-15 11:17:12,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID [2022-04-15 11:17:12,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:12,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {589#true} is VALID [2022-04-15 11:17:12,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-15 11:17:12,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID [2022-04-15 11:17:12,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {589#true} call #t~ret18 := main(); {589#true} is VALID [2022-04-15 11:17:12,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {589#true} is VALID [2022-04-15 11:17:12,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {589#true} is VALID [2022-04-15 11:17:12,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {589#true} is VALID [2022-04-15 11:17:12,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#true} assume !(0 != ~p1~0); {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p2~0); {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p10~0); {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:12,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p1~0; {590#false} is VALID [2022-04-15 11:17:12,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {590#false} assume 1 != ~lk1~0; {590#false} is VALID [2022-04-15 11:17:12,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {590#false} assume !false; {590#false} is VALID [2022-04-15 11:17:12,061 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,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:12,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231365847] [2022-04-15 11:17:12,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231365847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:12,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309284272] [2022-04-15 11:17:12,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309284272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766519437] [2022-04-15 11:17:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:12,063 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:12,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:12,063 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:12,083 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:12,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:12,084 INFO L87 Difference]: Start difference. First operand 63 states and 114 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:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,379 INFO L93 Difference]: Finished difference Result 148 states and 273 transitions. [2022-04-15 11:17:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:12,380 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:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:12,380 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:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-15 11:17:12,384 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:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-15 11:17:12,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-15 11:17:12,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,616 INFO L225 Difference]: With dead ends: 148 [2022-04-15 11:17:12,617 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 11:17:12,618 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,621 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:12,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 119 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 11:17:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-15 11:17:12,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:12,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states 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,646 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states 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,646 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states 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,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,650 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-15 11:17:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-15 11:17:12,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:12,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:12,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 11:17:12,663 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 11:17:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,670 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-15 11:17:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-15 11:17:12,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:12,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:12,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:12,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states 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,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 162 transitions. [2022-04-15 11:17:12,675 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 162 transitions. Word has length 24 [2022-04-15 11:17:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:12,675 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 162 transitions. [2022-04-15 11:17:12,675 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:12,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 162 transitions. [2022-04-15 11:17:12,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 162 transitions. [2022-04-15 11:17:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:12,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:12,824 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:12,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:17:12,825 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 1 times [2022-04-15 11:17:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [612233558] [2022-04-15 11:17:12,826 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:12,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 2 times [2022-04-15 11:17:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:12,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346711779] [2022-04-15 11:17:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1257#true} is VALID [2022-04-15 11:17:12,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-15 11:17:12,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID [2022-04-15 11:17:12,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:12,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1257#true} is VALID [2022-04-15 11:17:12,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-15 11:17:12,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID [2022-04-15 11:17:12,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret18 := main(); {1257#true} is VALID [2022-04-15 11:17:12,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1257#true} is VALID [2022-04-15 11:17:12,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {1257#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1257#true} is VALID [2022-04-15 11:17:12,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1257#true} is VALID [2022-04-15 11:17:12,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {1257#true} assume 0 != ~p1~0;~lk1~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:12,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1258#false} is VALID [2022-04-15 11:17:12,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#false} assume 0 != ~p2~0; {1258#false} is VALID [2022-04-15 11:17:12,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {1258#false} assume 1 != ~lk2~0; {1258#false} is VALID [2022-04-15 11:17:12,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-15 11:17:12,917 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,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346711779] [2022-04-15 11:17:12,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346711779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:12,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [612233558] [2022-04-15 11:17:12,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [612233558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055615306] [2022-04-15 11:17:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:12,919 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:12,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:12,920 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:12,938 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:12,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:12,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:12,940 INFO L87 Difference]: Start difference. First operand 89 states and 162 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:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,175 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions. [2022-04-15 11:17:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:13,176 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:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:13,177 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:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-15 11:17:13,181 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:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-15 11:17:13,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-15 11:17:13,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,383 INFO L225 Difference]: With dead ends: 136 [2022-04-15 11:17:13,384 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 11:17:13,384 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,387 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:13,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 11:17:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-04-15 11:17:13,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:13,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states 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,412 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states 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,413 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states 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,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,416 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-15 11:17:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-15 11:17:13,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 11:17:13,420 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 11:17:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,424 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-15 11:17:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-15 11:17:13,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:13,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states 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,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2022-04-15 11:17:13,431 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 25 [2022-04-15 11:17:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:13,432 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2022-04-15 11:17:13,432 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:13,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 164 transitions. [2022-04-15 11:17:13,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2022-04-15 11:17:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:13,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:13,587 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:13,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:17:13,587 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 1 times [2022-04-15 11:17:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597804883] [2022-04-15 11:17:13,589 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 2 times [2022-04-15 11:17:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:13,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228930194] [2022-04-15 11:17:13,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1913#true} is VALID [2022-04-15 11:17:13,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {1913#true} assume true; {1913#true} is VALID [2022-04-15 11:17:13,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID [2022-04-15 11:17:13,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:13,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1913#true} is VALID [2022-04-15 11:17:13,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2022-04-15 11:17:13,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID [2022-04-15 11:17:13,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret18 := main(); {1913#true} is VALID [2022-04-15 11:17:13,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {1913#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1913#true} is VALID [2022-04-15 11:17:13,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {1913#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1913#true} is VALID [2022-04-15 11:17:13,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {1913#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1913#true} is VALID [2022-04-15 11:17:13,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {1913#true} assume !(0 != ~p1~0); {1913#true} is VALID [2022-04-15 11:17:13,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {1913#true} assume !(0 != ~p2~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:13,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p2~0; {1914#false} is VALID [2022-04-15 11:17:13,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#false} assume 1 != ~lk2~0; {1914#false} is VALID [2022-04-15 11:17:13,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2022-04-15 11:17:13,665 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,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:13,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228930194] [2022-04-15 11:17:13,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228930194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:13,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597804883] [2022-04-15 11:17:13,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597804883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565754303] [2022-04-15 11:17:13,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:13,667 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:13,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:13,668 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:13,723 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:13,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:13,724 INFO L87 Difference]: Start difference. First operand 92 states and 164 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:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,968 INFO L93 Difference]: Finished difference Result 256 states and 468 transitions. [2022-04-15 11:17:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:13,968 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:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:13,970 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:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-15 11:17:13,973 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:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-15 11:17:13,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-15 11:17:14,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,193 INFO L225 Difference]: With dead ends: 256 [2022-04-15 11:17:14,193 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 11:17:14,195 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,198 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:14,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 97 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 11:17:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-15 11:17:14,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:14,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states 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,231 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states 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,232 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states 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,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,240 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-15 11:17:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-15 11:17:14,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:14,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:14,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states 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:14,242 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states 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:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,250 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-15 11:17:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-15 11:17:14,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:14,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:14,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:14,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states 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,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 309 transitions. [2022-04-15 11:17:14,261 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 309 transitions. Word has length 25 [2022-04-15 11:17:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:14,261 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 309 transitions. [2022-04-15 11:17:14,261 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:14,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 309 transitions. [2022-04-15 11:17:14,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 309 transitions. [2022-04-15 11:17:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:14,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:14,555 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:14,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:17:14,555 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 1 times [2022-04-15 11:17:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [245763718] [2022-04-15 11:17:14,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 2 times [2022-04-15 11:17:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681514837] [2022-04-15 11:17:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3125#true} is VALID [2022-04-15 11:17:14,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {3125#true} assume true; {3125#true} is VALID [2022-04-15 11:17:14,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID [2022-04-15 11:17:14,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {3125#true} call ULTIMATE.init(); {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:14,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3125#true} is VALID [2022-04-15 11:17:14,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {3125#true} assume true; {3125#true} is VALID [2022-04-15 11:17:14,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID [2022-04-15 11:17:14,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {3125#true} call #t~ret18 := main(); {3125#true} is VALID [2022-04-15 11:17:14,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {3125#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {3125#true} is VALID [2022-04-15 11:17:14,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {3125#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {3125#true} is VALID [2022-04-15 11:17:14,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {3125#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {3125#true} is VALID [2022-04-15 11:17:14,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {3125#true} assume !(0 != ~p1~0); {3125#true} is VALID [2022-04-15 11:17:14,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {3125#true} assume 0 != ~p2~0;~lk2~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3130#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:14,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3126#false} is VALID [2022-04-15 11:17:14,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {3126#false} assume !false; {3126#false} is VALID [2022-04-15 11:17:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:14,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:14,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681514837] [2022-04-15 11:17:14,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681514837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:14,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [245763718] [2022-04-15 11:17:14,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [245763718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739604204] [2022-04-15 11:17:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:14,676 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:14,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:14,676 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:14,693 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:14,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:14,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:14,694 INFO L87 Difference]: Start difference. First operand 171 states and 309 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:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,903 INFO L93 Difference]: Finished difference Result 223 states and 403 transitions. [2022-04-15 11:17:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:14,903 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:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:14,904 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:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-15 11:17:14,906 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:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-15 11:17:14,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-15 11:17:15,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,029 INFO L225 Difference]: With dead ends: 223 [2022-04-15 11:17:15,030 INFO L226 Difference]: Without dead ends: 221 [2022-04-15 11:17:15,030 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,031 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:15,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-15 11:17:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 171. [2022-04-15 11:17:15,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:15,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states 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,047 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states 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,047 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states 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,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,054 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-15 11:17:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-15 11:17:15,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-15 11:17:15,055 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-15 11:17:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,062 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-15 11:17:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-15 11:17:15,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:15,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states 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,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 307 transitions. [2022-04-15 11:17:15,069 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 307 transitions. Word has length 25 [2022-04-15 11:17:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:15,069 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 307 transitions. [2022-04-15 11:17:15,069 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:15,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 307 transitions. [2022-04-15 11:17:15,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 307 transitions. [2022-04-15 11:17:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:15,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:15,334 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:15,334 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:17:15,334 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 1 times [2022-04-15 11:17:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:15,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [693298073] [2022-04-15 11:17:15,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 2 times [2022-04-15 11:17:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:15,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074269836] [2022-04-15 11:17:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:15,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:15,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4367#true} is VALID [2022-04-15 11:17:15,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {4367#true} assume true; {4367#true} is VALID [2022-04-15 11:17:15,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID [2022-04-15 11:17:15,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {4367#true} call ULTIMATE.init(); {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:15,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4367#true} is VALID [2022-04-15 11:17:15,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {4367#true} assume true; {4367#true} is VALID [2022-04-15 11:17:15,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID [2022-04-15 11:17:15,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {4367#true} call #t~ret18 := main(); {4367#true} is VALID [2022-04-15 11:17:15,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {4367#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {4367#true} is VALID [2022-04-15 11:17:15,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {4367#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {4367#true} is VALID [2022-04-15 11:17:15,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {4367#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {4367#true} is VALID [2022-04-15 11:17:15,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {4367#true} assume !(0 != ~p1~0); {4367#true} is VALID [2022-04-15 11:17:15,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {4367#true} assume !(0 != ~p2~0); {4367#true} is VALID [2022-04-15 11:17:15,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {4367#true} assume 0 != ~p3~0;~lk3~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4372#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:15,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {4372#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4368#false} is VALID [2022-04-15 11:17:15,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {4368#false} assume !false; {4368#false} is VALID [2022-04-15 11:17:15,417 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,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:15,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074269836] [2022-04-15 11:17:15,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074269836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:15,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:15,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:15,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:15,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [693298073] [2022-04-15 11:17:15,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [693298073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:15,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:15,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932930828] [2022-04-15 11:17:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:15,423 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:15,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:15,423 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:15,442 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:15,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:15,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:15,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:15,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:15,444 INFO L87 Difference]: Start difference. First operand 171 states and 307 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:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,699 INFO L93 Difference]: Finished difference Result 323 states and 587 transitions. [2022-04-15 11:17:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:15,699 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:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:15,700 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:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 11:17:15,702 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:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 11:17:15,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-15 11:17:15,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,849 INFO L225 Difference]: With dead ends: 323 [2022-04-15 11:17:15,849 INFO L226 Difference]: Without dead ends: 321 [2022-04-15 11:17:15,850 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,850 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:15,851 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-15 11:17:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 231. [2022-04-15 11:17:15,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:15,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states 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,870 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states 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,870 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states 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,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,880 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-15 11:17:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-15 11:17:15,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-15 11:17:15,882 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-15 11:17:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,896 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-15 11:17:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-15 11:17:15,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:15,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states 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,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 413 transitions. [2022-04-15 11:17:15,910 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 413 transitions. Word has length 26 [2022-04-15 11:17:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:15,911 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 413 transitions. [2022-04-15 11:17:15,911 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:15,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 413 transitions. [2022-04-15 11:17:16,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 413 transitions. [2022-04-15 11:17:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:16,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:16,322 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:16,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:17:16,322 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 1 times [2022-04-15 11:17:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065658449] [2022-04-15 11:17:16,323 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 2 times [2022-04-15 11:17:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:16,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754731431] [2022-04-15 11:17:16,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6129#true} is VALID [2022-04-15 11:17:16,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {6129#true} assume true; {6129#true} is VALID [2022-04-15 11:17:16,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID [2022-04-15 11:17:16,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {6129#true} call ULTIMATE.init(); {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:16,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6129#true} is VALID [2022-04-15 11:17:16,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {6129#true} assume true; {6129#true} is VALID [2022-04-15 11:17:16,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID [2022-04-15 11:17:16,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {6129#true} call #t~ret18 := main(); {6129#true} is VALID [2022-04-15 11:17:16,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {6129#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {6129#true} is VALID [2022-04-15 11:17:16,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {6129#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {6129#true} is VALID [2022-04-15 11:17:16,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {6129#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {6129#true} is VALID [2022-04-15 11:17:16,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {6129#true} assume !(0 != ~p1~0); {6129#true} is VALID [2022-04-15 11:17:16,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {6129#true} assume !(0 != ~p2~0); {6129#true} is VALID [2022-04-15 11:17:16,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {6129#true} assume !(0 != ~p3~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p3~0; {6130#false} is VALID [2022-04-15 11:17:16,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {6130#false} assume 1 != ~lk3~0; {6130#false} is VALID [2022-04-15 11:17:16,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {6130#false} assume !false; {6130#false} is VALID [2022-04-15 11:17:16,378 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,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:16,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754731431] [2022-04-15 11:17:16,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754731431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:16,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065658449] [2022-04-15 11:17:16,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065658449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94502230] [2022-04-15 11:17:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:16,379 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:16,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:16,380 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:16,396 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:16,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:16,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:16,397 INFO L87 Difference]: Start difference. First operand 231 states and 413 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:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,661 INFO L93 Difference]: Finished difference Result 551 states and 995 transitions. [2022-04-15 11:17:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:16,661 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:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:16,662 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:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-15 11:17:16,664 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:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-15 11:17:16,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-15 11:17:16,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,838 INFO L225 Difference]: With dead ends: 551 [2022-04-15 11:17:16,839 INFO L226 Difference]: Without dead ends: 329 [2022-04-15 11:17:16,839 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,840 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:16,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 123 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-15 11:17:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-15 11:17:16,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:16,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states 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,866 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states 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,866 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states 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,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,874 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-15 11:17:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-15 11:17:16,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:16,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:16,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-15 11:17:16,876 INFO L87 Difference]: Start difference. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-15 11:17:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,884 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-15 11:17:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-15 11:17:16,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:16,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:16,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:16,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states 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,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 583 transitions. [2022-04-15 11:17:16,894 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 583 transitions. Word has length 26 [2022-04-15 11:17:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:16,894 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 583 transitions. [2022-04-15 11:17:16,894 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:16,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 583 transitions. [2022-04-15 11:17:17,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 583 transitions. [2022-04-15 11:17:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:17,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:17,450 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:17,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:17:17,450 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 1 times [2022-04-15 11:17:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:17,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951122568] [2022-04-15 11:17:17,451 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 2 times [2022-04-15 11:17:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:17,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116620844] [2022-04-15 11:17:17,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:17,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:17,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8555#true} is VALID [2022-04-15 11:17:17,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {8555#true} assume true; {8555#true} is VALID [2022-04-15 11:17:17,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID [2022-04-15 11:17:17,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {8555#true} call ULTIMATE.init(); {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:17,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8555#true} is VALID [2022-04-15 11:17:17,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {8555#true} assume true; {8555#true} is VALID [2022-04-15 11:17:17,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID [2022-04-15 11:17:17,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {8555#true} call #t~ret18 := main(); {8555#true} is VALID [2022-04-15 11:17:17,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {8555#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {8555#true} is VALID [2022-04-15 11:17:17,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {8555#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {8555#true} is VALID [2022-04-15 11:17:17,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {8555#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {8555#true} is VALID [2022-04-15 11:17:17,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {8555#true} assume !(0 != ~p1~0); {8555#true} is VALID [2022-04-15 11:17:17,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {8555#true} assume !(0 != ~p2~0); {8555#true} is VALID [2022-04-15 11:17:17,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {8555#true} assume 0 != ~p3~0;~lk3~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {8556#false} is VALID [2022-04-15 11:17:17,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {8556#false} assume 0 != ~p4~0; {8556#false} is VALID [2022-04-15 11:17:17,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {8556#false} assume 1 != ~lk4~0; {8556#false} is VALID [2022-04-15 11:17:17,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {8556#false} assume !false; {8556#false} is VALID [2022-04-15 11:17:17,510 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,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:17,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116620844] [2022-04-15 11:17:17,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116620844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:17,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:17,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:17,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:17,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1951122568] [2022-04-15 11:17:17,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1951122568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:17,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:17,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644224918] [2022-04-15 11:17:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:17,512 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:17,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:17,512 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:17,529 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:17,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:17,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:17,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:17,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:17,530 INFO L87 Difference]: Start difference. First operand 327 states and 583 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:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,802 INFO L93 Difference]: Finished difference Result 493 states and 877 transitions. [2022-04-15 11:17:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:17,802 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:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:17,803 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:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-15 11:17:17,805 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:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-15 11:17:17,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-15 11:17:17,960 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:17,972 INFO L225 Difference]: With dead ends: 493 [2022-04-15 11:17:17,972 INFO L226 Difference]: Without dead ends: 335 [2022-04-15 11:17:17,973 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,973 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 168 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:17,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 137 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-15 11:17:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2022-04-15 11:17:17,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:17,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states 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,999 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states 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,000 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states 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,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:18,007 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-15 11:17:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-15 11:17:18,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:18,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:18,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states. [2022-04-15 11:17:18,010 INFO L87 Difference]: Start difference. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states. [2022-04-15 11:17:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:18,018 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-15 11:17:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-15 11:17:18,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:18,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:18,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:18,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states 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,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 587 transitions. [2022-04-15 11:17:18,029 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 587 transitions. Word has length 27 [2022-04-15 11:17:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:18,029 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 587 transitions. [2022-04-15 11:17:18,029 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:18,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 587 transitions. [2022-04-15 11:17:18,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 587 transitions. [2022-04-15 11:17:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:18,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:18,614 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:18,614 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:17:18,615 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 1 times [2022-04-15 11:17:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:18,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [789241467] [2022-04-15 11:17:18,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 2 times [2022-04-15 11:17:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:18,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689292011] [2022-04-15 11:17:18,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:18,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:18,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10889#true} is VALID [2022-04-15 11:17:18,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-15 11:17:18,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID [2022-04-15 11:17:18,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:18,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10889#true} is VALID [2022-04-15 11:17:18,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-15 11:17:18,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID [2022-04-15 11:17:18,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {10889#true} call #t~ret18 := main(); {10889#true} is VALID [2022-04-15 11:17:18,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {10889#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {10889#true} is VALID [2022-04-15 11:17:18,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {10889#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {10889#true} is VALID [2022-04-15 11:17:18,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {10889#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {10889#true} is VALID [2022-04-15 11:17:18,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {10889#true} assume !(0 != ~p1~0); {10889#true} is VALID [2022-04-15 11:17:18,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {10889#true} assume !(0 != ~p2~0); {10889#true} is VALID [2022-04-15 11:17:18,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {10889#true} assume !(0 != ~p3~0); {10889#true} is VALID [2022-04-15 11:17:18,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {10889#true} assume 0 != ~p4~0;~lk4~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10894#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {10894#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10890#false} is VALID [2022-04-15 11:17:18,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2022-04-15 11:17:18,669 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,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:18,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689292011] [2022-04-15 11:17:18,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689292011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:18,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:18,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:18,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [789241467] [2022-04-15 11:17:18,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [789241467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:18,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:18,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002850131] [2022-04-15 11:17:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:18,670 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:18,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:18,671 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:18,687 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:18,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:18,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:18,688 INFO L87 Difference]: Start difference. First operand 333 states and 587 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:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:18,940 INFO L93 Difference]: Finished difference Result 621 states and 1109 transitions. [2022-04-15 11:17:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:18,941 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:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:18,941 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:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-15 11:17:18,942 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:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-15 11:17:18,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-15 11:17:19,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:19,097 INFO L225 Difference]: With dead ends: 621 [2022-04-15 11:17:19,097 INFO L226 Difference]: Without dead ends: 619 [2022-04-15 11:17:19,098 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,098 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:19,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 93 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-15 11:17:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457. [2022-04-15 11:17:19,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:19,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states 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,134 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states 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,134 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states 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,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,154 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-15 11:17:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-15 11:17:19,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:19,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:19,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-15 11:17:19,158 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-15 11:17:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,178 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-15 11:17:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-15 11:17:19,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:19,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:19,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:19,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states 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,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 795 transitions. [2022-04-15 11:17:19,196 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 795 transitions. Word has length 27 [2022-04-15 11:17:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:19,196 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 795 transitions. [2022-04-15 11:17:19,196 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:19,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 795 transitions. [2022-04-15 11:17:20,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 795 edges. 795 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 795 transitions. [2022-04-15 11:17:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:20,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:20,035 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:20,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:17:20,035 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 1 times [2022-04-15 11:17:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:20,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872056651] [2022-04-15 11:17:20,036 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 2 times [2022-04-15 11:17:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:20,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148049724] [2022-04-15 11:17:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:20,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14295#true} is VALID [2022-04-15 11:17:20,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-15 11:17:20,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID [2022-04-15 11:17:20,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:20,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14295#true} is VALID [2022-04-15 11:17:20,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-15 11:17:20,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID [2022-04-15 11:17:20,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {14295#true} call #t~ret18 := main(); {14295#true} is VALID [2022-04-15 11:17:20,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {14295#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {14295#true} is VALID [2022-04-15 11:17:20,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {14295#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {14295#true} is VALID [2022-04-15 11:17:20,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {14295#true} is VALID [2022-04-15 11:17:20,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 != ~p1~0); {14295#true} is VALID [2022-04-15 11:17:20,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume !(0 != ~p2~0); {14295#true} is VALID [2022-04-15 11:17:20,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {14295#true} assume !(0 != ~p3~0); {14295#true} is VALID [2022-04-15 11:17:20,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {14295#true} assume !(0 != ~p4~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p10~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p1~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p2~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p3~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p4~0; {14296#false} is VALID [2022-04-15 11:17:20,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {14296#false} assume 1 != ~lk4~0; {14296#false} is VALID [2022-04-15 11:17:20,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-15 11:17:20,105 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,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:20,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148049724] [2022-04-15 11:17:20,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148049724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:20,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:20,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:20,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:20,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872056651] [2022-04-15 11:17:20,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872056651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:20,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:20,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378173022] [2022-04-15 11:17:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:20,108 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:20,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:20,108 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:20,125 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:20,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:20,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:20,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:20,126 INFO L87 Difference]: Start difference. First operand 457 states and 795 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:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,445 INFO L93 Difference]: Finished difference Result 1085 states and 1901 transitions. [2022-04-15 11:17:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:20,446 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:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:20,447 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:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-15 11:17:20,449 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:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-15 11:17:20,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 237 transitions. [2022-04-15 11:17:20,624 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:20,650 INFO L225 Difference]: With dead ends: 1085 [2022-04-15 11:17:20,651 INFO L226 Difference]: Without dead ends: 643 [2022-04-15 11:17:20,651 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:20,652 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:20,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 125 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-15 11:17:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2022-04-15 11:17:20,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:20,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states 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,716 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states 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,718 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states 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,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,741 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-15 11:17:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-15 11:17:20,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:20,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:20,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states. [2022-04-15 11:17:20,744 INFO L87 Difference]: Start difference. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states. [2022-04-15 11:17:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,765 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-15 11:17:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-15 11:17:20,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:20,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:20,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:20,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states 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,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1111 transitions. [2022-04-15 11:17:20,794 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1111 transitions. Word has length 27 [2022-04-15 11:17:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:20,794 INFO L478 AbstractCegarLoop]: Abstraction has 641 states and 1111 transitions. [2022-04-15 11:17:20,794 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:20,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 641 states and 1111 transitions. [2022-04-15 11:17:21,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1111 transitions. [2022-04-15 11:17:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:21,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:21,942 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:21,942 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:17:21,942 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 1 times [2022-04-15 11:17:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:21,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315724436] [2022-04-15 11:17:21,943 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 2 times [2022-04-15 11:17:21,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:21,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328240437] [2022-04-15 11:17:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:22,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:22,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19045#true} is VALID [2022-04-15 11:17:22,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {19045#true} assume true; {19045#true} is VALID [2022-04-15 11:17:22,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID [2022-04-15 11:17:22,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {19045#true} call ULTIMATE.init(); {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:22,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19045#true} is VALID [2022-04-15 11:17:22,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {19045#true} assume true; {19045#true} is VALID [2022-04-15 11:17:22,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID [2022-04-15 11:17:22,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {19045#true} call #t~ret18 := main(); {19045#true} is VALID [2022-04-15 11:17:22,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {19045#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {19045#true} is VALID [2022-04-15 11:17:22,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {19045#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {19045#true} is VALID [2022-04-15 11:17:22,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {19045#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {19045#true} is VALID [2022-04-15 11:17:22,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {19045#true} assume !(0 != ~p1~0); {19045#true} is VALID [2022-04-15 11:17:22,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {19045#true} assume !(0 != ~p2~0); {19045#true} is VALID [2022-04-15 11:17:22,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {19045#true} assume !(0 != ~p3~0); {19045#true} is VALID [2022-04-15 11:17:22,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {19045#true} assume 0 != ~p4~0;~lk4~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:22,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {19046#false} is VALID [2022-04-15 11:17:22,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {19046#false} assume 0 != ~p5~0; {19046#false} is VALID [2022-04-15 11:17:22,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {19046#false} assume 1 != ~lk5~0; {19046#false} is VALID [2022-04-15 11:17:22,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {19046#false} assume !false; {19046#false} is VALID [2022-04-15 11:17:22,013 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,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:22,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328240437] [2022-04-15 11:17:22,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328240437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:22,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:22,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:22,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:22,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315724436] [2022-04-15 11:17:22,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315724436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:22,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:22,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285605865] [2022-04-15 11:17:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:22,015 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:22,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:22,015 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:22,032 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:22,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:22,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:22,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:22,033 INFO L87 Difference]: Start difference. First operand 641 states and 1111 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:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,347 INFO L93 Difference]: Finished difference Result 961 states and 1661 transitions. [2022-04-15 11:17:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:22,348 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:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:22,348 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:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-15 11:17:22,350 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:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-15 11:17:22,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 232 transitions. [2022-04-15 11:17:22,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:22,550 INFO L225 Difference]: With dead ends: 961 [2022-04-15 11:17:22,550 INFO L226 Difference]: Without dead ends: 651 [2022-04-15 11:17:22,551 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:22,552 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:22,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 134 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-04-15 11:17:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2022-04-15 11:17:22,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:22,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states 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,607 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states 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,608 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states 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,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,631 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-15 11:17:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-15 11:17:22,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:22,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:22,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states. [2022-04-15 11:17:22,635 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states. [2022-04-15 11:17:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,655 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-15 11:17:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-15 11:17:22,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:22,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:22,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:22,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states 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,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1111 transitions. [2022-04-15 11:17:22,696 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1111 transitions. Word has length 28 [2022-04-15 11:17:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:22,697 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 1111 transitions. [2022-04-15 11:17:22,697 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:22,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1111 transitions. [2022-04-15 11:17:23,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1111 transitions. [2022-04-15 11:17:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:23,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:23,881 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:23,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:17:23,881 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:23,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:23,882 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 1 times [2022-04-15 11:17:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:23,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1087727317] [2022-04-15 11:17:23,882 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 2 times [2022-04-15 11:17:23,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:23,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088637417] [2022-04-15 11:17:23,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:23,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {23579#true} is VALID [2022-04-15 11:17:23,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {23579#true} assume true; {23579#true} is VALID [2022-04-15 11:17:23,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID [2022-04-15 11:17:23,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {23579#true} call ULTIMATE.init(); {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:23,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {23579#true} is VALID [2022-04-15 11:17:23,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {23579#true} assume true; {23579#true} is VALID [2022-04-15 11:17:23,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID [2022-04-15 11:17:23,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {23579#true} call #t~ret18 := main(); {23579#true} is VALID [2022-04-15 11:17:23,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {23579#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {23579#true} is VALID [2022-04-15 11:17:23,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {23579#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {23579#true} is VALID [2022-04-15 11:17:23,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {23579#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {23579#true} is VALID [2022-04-15 11:17:23,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {23579#true} assume !(0 != ~p1~0); {23579#true} is VALID [2022-04-15 11:17:23,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {23579#true} assume !(0 != ~p2~0); {23579#true} is VALID [2022-04-15 11:17:23,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {23579#true} assume !(0 != ~p3~0); {23579#true} is VALID [2022-04-15 11:17:23,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {23579#true} assume !(0 != ~p4~0); {23579#true} is VALID [2022-04-15 11:17:23,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {23579#true} assume 0 != ~p5~0;~lk5~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p5~0; {23584#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {23584#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {23580#false} is VALID [2022-04-15 11:17:23,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {23580#false} assume !false; {23580#false} is VALID [2022-04-15 11:17:23,931 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:23,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088637417] [2022-04-15 11:17:23,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088637417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:23,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:23,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:23,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1087727317] [2022-04-15 11:17:23,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1087727317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:23,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:23,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486910583] [2022-04-15 11:17:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:23,933 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:23,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:23,933 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:23,950 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:23,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:23,951 INFO L87 Difference]: Start difference. First operand 649 states and 1111 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:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:24,313 INFO L93 Difference]: Finished difference Result 1197 states and 2081 transitions. [2022-04-15 11:17:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:24,313 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:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:24,313 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:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 11:17:24,315 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:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 11:17:24,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 11:17:24,451 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:24,539 INFO L225 Difference]: With dead ends: 1197 [2022-04-15 11:17:24,540 INFO L226 Difference]: Without dead ends: 1195 [2022-04-15 11:17:24,540 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:24,541 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:24,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-04-15 11:17:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 905. [2022-04-15 11:17:24,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:24,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states 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:24,615 INFO L74 IsIncluded]: Start isIncluded. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states 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:24,616 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states 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:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:24,675 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-15 11:17:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-15 11:17:24,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:24,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:24,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1195 states. [2022-04-15 11:17:24,681 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1195 states. [2022-04-15 11:17:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:24,743 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-15 11:17:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-15 11:17:24,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:24,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:24,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:24,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states 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:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1519 transitions. [2022-04-15 11:17:24,804 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1519 transitions. Word has length 28 [2022-04-15 11:17:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:24,805 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1519 transitions. [2022-04-15 11:17:24,805 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:24,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1519 transitions. [2022-04-15 11:17:26,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1519 edges. 1519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1519 transitions. [2022-04-15 11:17:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:26,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:26,304 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:26,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:17:26,304 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 1 times [2022-04-15 11:17:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:26,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [115848168] [2022-04-15 11:17:26,305 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 2 times [2022-04-15 11:17:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:26,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412937812] [2022-04-15 11:17:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:26,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {30185#true} is VALID [2022-04-15 11:17:26,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {30185#true} assume true; {30185#true} is VALID [2022-04-15 11:17:26,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID [2022-04-15 11:17:26,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {30185#true} call ULTIMATE.init(); {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:26,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {30185#true} is VALID [2022-04-15 11:17:26,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {30185#true} assume true; {30185#true} is VALID [2022-04-15 11:17:26,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID [2022-04-15 11:17:26,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {30185#true} call #t~ret18 := main(); {30185#true} is VALID [2022-04-15 11:17:26,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {30185#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {30185#true} is VALID [2022-04-15 11:17:26,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {30185#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {30185#true} is VALID [2022-04-15 11:17:26,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {30185#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {30185#true} is VALID [2022-04-15 11:17:26,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {30185#true} assume !(0 != ~p1~0); {30185#true} is VALID [2022-04-15 11:17:26,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {30185#true} assume !(0 != ~p2~0); {30185#true} is VALID [2022-04-15 11:17:26,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {30185#true} assume !(0 != ~p3~0); {30185#true} is VALID [2022-04-15 11:17:26,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {30185#true} assume !(0 != ~p4~0); {30185#true} is VALID [2022-04-15 11:17:26,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {30185#true} assume !(0 != ~p5~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p10~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p1~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p2~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p3~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p4~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:26,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p5~0; {30186#false} is VALID [2022-04-15 11:17:26,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {30186#false} assume 1 != ~lk5~0; {30186#false} is VALID [2022-04-15 11:17:26,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {30186#false} assume !false; {30186#false} is VALID [2022-04-15 11:17:26,366 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:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:26,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412937812] [2022-04-15 11:17:26,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412937812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:26,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:26,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:26,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:26,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [115848168] [2022-04-15 11:17:26,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [115848168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:26,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:26,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258371286] [2022-04-15 11:17:26,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:26,368 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:26,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:26,368 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:26,388 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:26,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:26,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:26,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:26,389 INFO L87 Difference]: Start difference. First operand 905 states and 1519 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:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:26,999 INFO L93 Difference]: Finished difference Result 2141 states and 3617 transitions. [2022-04-15 11:17:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:27,000 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:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:27,000 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:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-15 11:17:27,003 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:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-15 11:17:27,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 234 transitions. [2022-04-15 11:17:27,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:27,279 INFO L225 Difference]: With dead ends: 2141 [2022-04-15 11:17:27,279 INFO L226 Difference]: Without dead ends: 1259 [2022-04-15 11:17:27,280 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:27,281 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:27,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-04-15 11:17:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1257. [2022-04-15 11:17:27,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:27,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states 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,399 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states 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,400 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states 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,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:27,466 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-15 11:17:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-15 11:17:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:27,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:27,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1259 states. [2022-04-15 11:17:27,473 INFO L87 Difference]: Start difference. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1259 states. [2022-04-15 11:17:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:27,539 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-15 11:17:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-15 11:17:27,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:27,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:27,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:27,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states 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,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2103 transitions. [2022-04-15 11:17:27,643 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2103 transitions. Word has length 28 [2022-04-15 11:17:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:27,643 INFO L478 AbstractCegarLoop]: Abstraction has 1257 states and 2103 transitions. [2022-04-15 11:17:27,647 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:27,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1257 states and 2103 transitions. [2022-04-15 11:17:29,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2103 transitions. [2022-04-15 11:17:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:17:29,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:29,778 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:17:29,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:17:29,778 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 1 times [2022-04-15 11:17:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:29,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [957664005] [2022-04-15 11:17:29,779 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 2 times [2022-04-15 11:17:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:29,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894242104] [2022-04-15 11:17:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:29,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {39511#true} is VALID [2022-04-15 11:17:29,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {39511#true} assume true; {39511#true} is VALID [2022-04-15 11:17:29,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID [2022-04-15 11:17:29,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {39511#true} call ULTIMATE.init(); {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:29,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {39511#true} is VALID [2022-04-15 11:17:29,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {39511#true} assume true; {39511#true} is VALID [2022-04-15 11:17:29,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID [2022-04-15 11:17:29,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {39511#true} call #t~ret18 := main(); {39511#true} is VALID [2022-04-15 11:17:29,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {39511#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {39511#true} is VALID [2022-04-15 11:17:29,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {39511#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {39511#true} is VALID [2022-04-15 11:17:29,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {39511#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {39511#true} is VALID [2022-04-15 11:17:29,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {39511#true} assume !(0 != ~p1~0); {39511#true} is VALID [2022-04-15 11:17:29,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {39511#true} assume !(0 != ~p2~0); {39511#true} is VALID [2022-04-15 11:17:29,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {39511#true} assume !(0 != ~p3~0); {39511#true} is VALID [2022-04-15 11:17:29,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {39511#true} assume !(0 != ~p4~0); {39511#true} is VALID [2022-04-15 11:17:29,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {39511#true} assume 0 != ~p5~0;~lk5~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:29,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {39512#false} is VALID [2022-04-15 11:17:29,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {39512#false} assume 0 != ~p6~0; {39512#false} is VALID [2022-04-15 11:17:29,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {39512#false} assume 1 != ~lk6~0; {39512#false} is VALID [2022-04-15 11:17:29,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {39512#false} assume !false; {39512#false} is VALID [2022-04-15 11:17:29,859 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,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:29,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894242104] [2022-04-15 11:17:29,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894242104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:29,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:29,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:29,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:29,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [957664005] [2022-04-15 11:17:29,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [957664005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:29,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:29,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356162594] [2022-04-15 11:17:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:29,860 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:17:29,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:29,861 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:17:29,878 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:17:29,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:29,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:29,880 INFO L87 Difference]: Start difference. First operand 1257 states and 2103 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:17:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:30,417 INFO L93 Difference]: Finished difference Result 1885 states and 3145 transitions. [2022-04-15 11:17:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:30,417 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:17:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:30,417 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:17:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-15 11:17:30,421 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:17:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-15 11:17:30,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 229 transitions. [2022-04-15 11:17:30,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:30,692 INFO L225 Difference]: With dead ends: 1885 [2022-04-15 11:17:30,693 INFO L226 Difference]: Without dead ends: 1275 [2022-04-15 11:17:30,694 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,695 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:30,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-04-15 11:17:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1273. [2022-04-15 11:17:30,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:30,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states 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,827 INFO L74 IsIncluded]: Start isIncluded. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states 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,829 INFO L87 Difference]: Start difference. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states 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,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:30,892 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-15 11:17:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-15 11:17:30,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:30,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:30,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1275 states. [2022-04-15 11:17:30,898 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1275 states. [2022-04-15 11:17:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:30,958 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-15 11:17:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-15 11:17:30,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:30,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:30,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:30,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states 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,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2103 transitions. [2022-04-15 11:17:31,039 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2103 transitions. Word has length 29 [2022-04-15 11:17:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:31,039 INFO L478 AbstractCegarLoop]: Abstraction has 1273 states and 2103 transitions. [2022-04-15 11:17:31,039 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:17:31,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1273 states and 2103 transitions. [2022-04-15 11:17:33,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2103 transitions. [2022-04-15 11:17:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:17:33,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:33,076 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:33,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:17:33,077 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:33,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 1 times [2022-04-15 11:17:33,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:33,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259419676] [2022-04-15 11:17:33,078 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 2 times [2022-04-15 11:17:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:33,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84560942] [2022-04-15 11:17:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:33,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:33,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {48389#true} is VALID [2022-04-15 11:17:33,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {48389#true} assume true; {48389#true} is VALID [2022-04-15 11:17:33,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID [2022-04-15 11:17:33,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {48389#true} call ULTIMATE.init(); {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:33,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {48389#true} is VALID [2022-04-15 11:17:33,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {48389#true} assume true; {48389#true} is VALID [2022-04-15 11:17:33,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID [2022-04-15 11:17:33,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {48389#true} call #t~ret18 := main(); {48389#true} is VALID [2022-04-15 11:17:33,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {48389#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {48389#true} is VALID [2022-04-15 11:17:33,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {48389#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {48389#true} is VALID [2022-04-15 11:17:33,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {48389#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {48389#true} is VALID [2022-04-15 11:17:33,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {48389#true} assume !(0 != ~p1~0); {48389#true} is VALID [2022-04-15 11:17:33,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {48389#true} assume !(0 != ~p2~0); {48389#true} is VALID [2022-04-15 11:17:33,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {48389#true} assume !(0 != ~p3~0); {48389#true} is VALID [2022-04-15 11:17:33,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {48389#true} assume !(0 != ~p4~0); {48389#true} is VALID [2022-04-15 11:17:33,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {48389#true} assume !(0 != ~p5~0); {48389#true} is VALID [2022-04-15 11:17:33,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {48389#true} assume 0 != ~p6~0;~lk6~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p6~0; {48394#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:33,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {48394#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {48390#false} is VALID [2022-04-15 11:17:33,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {48390#false} assume !false; {48390#false} is VALID [2022-04-15 11:17:33,121 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,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:33,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84560942] [2022-04-15 11:17:33,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84560942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:33,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:33,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:33,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:33,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259419676] [2022-04-15 11:17:33,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259419676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:33,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:33,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613655115] [2022-04-15 11:17:33,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:33,123 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:17:33,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:33,123 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:17:33,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:17:33,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:33,142 INFO L87 Difference]: Start difference. First operand 1273 states and 2103 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:17:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:33,728 INFO L93 Difference]: Finished difference Result 2317 states and 3897 transitions. [2022-04-15 11:17:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:33,728 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:17:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:33,728 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:17:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 11:17:33,729 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:17:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 11:17:33,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-15 11:17:33,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:34,097 INFO L225 Difference]: With dead ends: 2317 [2022-04-15 11:17:34,097 INFO L226 Difference]: Without dead ends: 2315 [2022-04-15 11:17:34,098 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:34,099 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:34,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-15 11:17:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1801. [2022-04-15 11:17:34,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:34,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states 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,284 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states 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,286 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states 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,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:34,439 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-15 11:17:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-15 11:17:34,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:34,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:34,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-15 11:17:34,447 INFO L87 Difference]: Start difference. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-15 11:17:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:34,627 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-15 11:17:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-15 11:17:34,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:34,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:34,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:34,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states 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,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2903 transitions. [2022-04-15 11:17:34,769 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2903 transitions. Word has length 29 [2022-04-15 11:17:34,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:34,770 INFO L478 AbstractCegarLoop]: Abstraction has 1801 states and 2903 transitions. [2022-04-15 11:17:34,770 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:17:34,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1801 states and 2903 transitions. [2022-04-15 11:17:37,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2903 edges. 2903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2903 transitions. [2022-04-15 11:17:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:17:37,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:37,735 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:17:37,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:17:37,735 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 1 times [2022-04-15 11:17:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:37,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1611199856] [2022-04-15 11:17:37,736 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 2 times [2022-04-15 11:17:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:37,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526513829] [2022-04-15 11:17:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:37,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:37,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:37,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {61267#true} is VALID [2022-04-15 11:17:37,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 11:17:37,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID [2022-04-15 11:17:37,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {61267#true} call ULTIMATE.init(); {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:37,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {61267#true} is VALID [2022-04-15 11:17:37,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 11:17:37,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID [2022-04-15 11:17:37,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {61267#true} call #t~ret18 := main(); {61267#true} is VALID [2022-04-15 11:17:37,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {61267#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {61267#true} is VALID [2022-04-15 11:17:37,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {61267#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {61267#true} is VALID [2022-04-15 11:17:37,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {61267#true} is VALID [2022-04-15 11:17:37,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {61267#true} assume !(0 != ~p1~0); {61267#true} is VALID [2022-04-15 11:17:37,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {61267#true} assume !(0 != ~p2~0); {61267#true} is VALID [2022-04-15 11:17:37,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {61267#true} assume !(0 != ~p3~0); {61267#true} is VALID [2022-04-15 11:17:37,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {61267#true} assume !(0 != ~p4~0); {61267#true} is VALID [2022-04-15 11:17:37,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {61267#true} assume !(0 != ~p5~0); {61267#true} is VALID [2022-04-15 11:17:37,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {61267#true} assume !(0 != ~p6~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p10~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p1~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p2~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p3~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p4~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p5~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:37,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p6~0; {61268#false} is VALID [2022-04-15 11:17:37,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {61268#false} assume 1 != ~lk6~0; {61268#false} is VALID [2022-04-15 11:17:37,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {61268#false} assume !false; {61268#false} is VALID [2022-04-15 11:17:37,797 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:37,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:37,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526513829] [2022-04-15 11:17:37,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526513829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:37,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:37,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:37,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:37,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1611199856] [2022-04-15 11:17:37,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1611199856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:37,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:37,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142604267] [2022-04-15 11:17:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:37,798 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:17:37,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:37,799 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:17:37,819 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:17:37,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:37,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:37,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:37,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:37,820 INFO L87 Difference]: Start difference. First operand 1801 states and 2903 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:17:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:39,023 INFO L93 Difference]: Finished difference Result 4237 states and 6873 transitions. [2022-04-15 11:17:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:39,023 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:17:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:39,023 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:17:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-15 11:17:39,024 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:17:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-15 11:17:39,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 231 transitions. [2022-04-15 11:17:39,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:39,442 INFO L225 Difference]: With dead ends: 4237 [2022-04-15 11:17:39,442 INFO L226 Difference]: Without dead ends: 2475 [2022-04-15 11:17:39,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:39,445 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:39,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 129 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-04-15 11:17:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473. [2022-04-15 11:17:39,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:39,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states 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,719 INFO L74 IsIncluded]: Start isIncluded. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states 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,722 INFO L87 Difference]: Start difference. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states 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,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:39,958 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-15 11:17:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-15 11:17:39,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:39,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:39,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2475 states. [2022-04-15 11:17:39,967 INFO L87 Difference]: Start difference. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2475 states. [2022-04-15 11:17:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:40,202 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-15 11:17:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-15 11:17:40,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:40,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:40,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:40,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states 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:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3975 transitions. [2022-04-15 11:17:40,620 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3975 transitions. Word has length 29 [2022-04-15 11:17:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:40,620 INFO L478 AbstractCegarLoop]: Abstraction has 2473 states and 3975 transitions. [2022-04-15 11:17:40,621 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:17:40,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2473 states and 3975 transitions. [2022-04-15 11:17:44,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3975 transitions. [2022-04-15 11:17:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:17:44,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:44,826 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:17:44,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:17:44,827 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 1 times [2022-04-15 11:17:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:44,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1692334553] [2022-04-15 11:17:44,827 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 2 times [2022-04-15 11:17:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:44,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028336225] [2022-04-15 11:17:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:44,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {79649#true} is VALID [2022-04-15 11:17:44,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {79649#true} assume true; {79649#true} is VALID [2022-04-15 11:17:44,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID [2022-04-15 11:17:44,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {79649#true} call ULTIMATE.init(); {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:44,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {79649#true} is VALID [2022-04-15 11:17:44,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {79649#true} assume true; {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {79649#true} call #t~ret18 := main(); {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {79649#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {79649#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {79649#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {79649#true} assume !(0 != ~p1~0); {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {79649#true} assume !(0 != ~p2~0); {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {79649#true} assume !(0 != ~p3~0); {79649#true} is VALID [2022-04-15 11:17:44,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {79649#true} assume !(0 != ~p4~0); {79649#true} is VALID [2022-04-15 11:17:44,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {79649#true} assume !(0 != ~p5~0); {79649#true} is VALID [2022-04-15 11:17:44,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {79649#true} assume 0 != ~p6~0;~lk6~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:44,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {79650#false} is VALID [2022-04-15 11:17:44,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {79650#false} assume 0 != ~p7~0; {79650#false} is VALID [2022-04-15 11:17:44,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {79650#false} assume 1 != ~lk7~0; {79650#false} is VALID [2022-04-15 11:17:44,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {79650#false} assume !false; {79650#false} is VALID [2022-04-15 11:17:44,870 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:44,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:44,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028336225] [2022-04-15 11:17:44,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028336225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:44,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:44,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:44,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:44,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1692334553] [2022-04-15 11:17:44,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1692334553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:44,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:44,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:44,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236993249] [2022-04-15 11:17:44,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:44,872 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:17:44,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:44,872 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:17:44,891 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:17:44,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:44,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:44,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:44,892 INFO L87 Difference]: Start difference. First operand 2473 states and 3975 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:17:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:45,888 INFO L93 Difference]: Finished difference Result 3709 states and 5945 transitions. [2022-04-15 11:17:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:45,889 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:17:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:45,889 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:17:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-15 11:17:45,890 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:17:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-15 11:17:45,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-15 11:17:46,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:46,291 INFO L225 Difference]: With dead ends: 3709 [2022-04-15 11:17:46,291 INFO L226 Difference]: Without dead ends: 2507 [2022-04-15 11:17:46,294 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:46,294 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:46,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 128 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-15 11:17:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2022-04-15 11:17:46,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:46,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states 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:46,519 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states 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:46,521 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states 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:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:46,762 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-15 11:17:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-15 11:17:46,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:46,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:46,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states. [2022-04-15 11:17:46,772 INFO L87 Difference]: Start difference. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states. [2022-04-15 11:17:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:46,988 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-15 11:17:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-15 11:17:46,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:46,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:46,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:46,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states 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:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3975 transitions. [2022-04-15 11:17:47,300 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3975 transitions. Word has length 30 [2022-04-15 11:17:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:47,301 INFO L478 AbstractCegarLoop]: Abstraction has 2505 states and 3975 transitions. [2022-04-15 11:17:47,301 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:17:47,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2505 states and 3975 transitions. [2022-04-15 11:17:51,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3975 transitions. [2022-04-15 11:17:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:17:51,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:51,430 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:51,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:17:51,430 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 1 times [2022-04-15 11:17:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:51,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [602967474] [2022-04-15 11:17:51,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 2 times [2022-04-15 11:17:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:51,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428252630] [2022-04-15 11:17:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:51,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {97103#true} is VALID [2022-04-15 11:17:51,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {97103#true} assume true; {97103#true} is VALID [2022-04-15 11:17:51,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID [2022-04-15 11:17:51,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {97103#true} call ULTIMATE.init(); {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:51,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {97103#true} is VALID [2022-04-15 11:17:51,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {97103#true} assume true; {97103#true} is VALID [2022-04-15 11:17:51,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID [2022-04-15 11:17:51,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {97103#true} call #t~ret18 := main(); {97103#true} is VALID [2022-04-15 11:17:51,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {97103#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {97103#true} is VALID [2022-04-15 11:17:51,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {97103#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {97103#true} is VALID [2022-04-15 11:17:51,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {97103#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {97103#true} is VALID [2022-04-15 11:17:51,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {97103#true} assume !(0 != ~p1~0); {97103#true} is VALID [2022-04-15 11:17:51,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {97103#true} assume !(0 != ~p2~0); {97103#true} is VALID [2022-04-15 11:17:51,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {97103#true} assume !(0 != ~p3~0); {97103#true} is VALID [2022-04-15 11:17:51,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {97103#true} assume !(0 != ~p4~0); {97103#true} is VALID [2022-04-15 11:17:51,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {97103#true} assume !(0 != ~p5~0); {97103#true} is VALID [2022-04-15 11:17:51,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {97103#true} assume !(0 != ~p6~0); {97103#true} is VALID [2022-04-15 11:17:51,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {97103#true} assume 0 != ~p7~0;~lk7~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p7~0; {97108#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:51,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {97108#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {97104#false} is VALID [2022-04-15 11:17:51,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {97104#false} assume !false; {97104#false} is VALID [2022-04-15 11:17:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:51,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428252630] [2022-04-15 11:17:51,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428252630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:51,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:51,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:51,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:51,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [602967474] [2022-04-15 11:17:51,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [602967474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:51,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:51,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826876249] [2022-04-15 11:17:51,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:51,481 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:17:51,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:51,481 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:17:51,499 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:17:51,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:51,500 INFO L87 Difference]: Start difference. First operand 2505 states and 3975 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:17:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:52,892 INFO L93 Difference]: Finished difference Result 4493 states and 7273 transitions. [2022-04-15 11:17:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:52,892 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:17:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:52,893 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:17:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-15 11:17:52,894 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:17:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-15 11:17:52,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-15 11:17:52,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:53,806 INFO L225 Difference]: With dead ends: 4493 [2022-04-15 11:17:53,806 INFO L226 Difference]: Without dead ends: 4491 [2022-04-15 11:17:53,807 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:53,807 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:53,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 90 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-15 11:17:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3593. [2022-04-15 11:17:54,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:54,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states 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:54,176 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states 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:54,179 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states 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:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:54,702 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-15 11:17:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-15 11:17:54,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:54,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:54,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-15 11:17:54,716 INFO L87 Difference]: Start difference. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-15 11:17:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:55,220 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-15 11:17:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-15 11:17:55,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:55,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:55,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:55,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states 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:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5543 transitions. [2022-04-15 11:17:55,811 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5543 transitions. Word has length 30 [2022-04-15 11:17:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:55,811 INFO L478 AbstractCegarLoop]: Abstraction has 3593 states and 5543 transitions. [2022-04-15 11:17:55,812 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:17:55,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3593 states and 5543 transitions. [2022-04-15 11:18:01,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5543 edges. 5543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5543 transitions. [2022-04-15 11:18:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:18:01,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:01,512 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:18:01,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:18:01,513 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 1 times [2022-04-15 11:18:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:01,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259235566] [2022-04-15 11:18:01,515 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 2 times [2022-04-15 11:18:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:01,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910623930] [2022-04-15 11:18:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:01,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:01,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {122269#true} is VALID [2022-04-15 11:18:01,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {122269#true} assume true; {122269#true} is VALID [2022-04-15 11:18:01,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID [2022-04-15 11:18:01,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {122269#true} call ULTIMATE.init(); {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:01,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {122269#true} is VALID [2022-04-15 11:18:01,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {122269#true} assume true; {122269#true} is VALID [2022-04-15 11:18:01,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID [2022-04-15 11:18:01,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {122269#true} call #t~ret18 := main(); {122269#true} is VALID [2022-04-15 11:18:01,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {122269#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {122269#true} is VALID [2022-04-15 11:18:01,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {122269#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {122269#true} is VALID [2022-04-15 11:18:01,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {122269#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {122269#true} is VALID [2022-04-15 11:18:01,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {122269#true} assume !(0 != ~p1~0); {122269#true} is VALID [2022-04-15 11:18:01,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {122269#true} assume !(0 != ~p2~0); {122269#true} is VALID [2022-04-15 11:18:01,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {122269#true} assume !(0 != ~p3~0); {122269#true} is VALID [2022-04-15 11:18:01,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {122269#true} assume !(0 != ~p4~0); {122269#true} is VALID [2022-04-15 11:18:01,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {122269#true} assume !(0 != ~p5~0); {122269#true} is VALID [2022-04-15 11:18:01,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {122269#true} assume !(0 != ~p6~0); {122269#true} is VALID [2022-04-15 11:18:01,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {122269#true} assume !(0 != ~p7~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p10~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p1~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p2~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p3~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p4~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p5~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p6~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-15 11:18:01,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p7~0; {122270#false} is VALID [2022-04-15 11:18:01,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {122270#false} assume 1 != ~lk7~0; {122270#false} is VALID [2022-04-15 11:18:01,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {122270#false} assume !false; {122270#false} is VALID [2022-04-15 11:18:01,564 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:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910623930] [2022-04-15 11:18:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910623930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:01,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:01,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:01,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259235566] [2022-04-15 11:18:01,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259235566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:01,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:01,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:01,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144652504] [2022-04-15 11:18:01,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:01,566 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:18:01,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:01,566 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:18:01,583 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:18:01,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:01,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:01,584 INFO L87 Difference]: Start difference. First operand 3593 states and 5543 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:18:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:05,219 INFO L93 Difference]: Finished difference Result 8397 states and 13033 transitions. [2022-04-15 11:18:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:05,219 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:18:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:05,219 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:18:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 11:18:05,220 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:18:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 11:18:05,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-15 11:18:05,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:06,284 INFO L225 Difference]: With dead ends: 8397 [2022-04-15 11:18:06,284 INFO L226 Difference]: Without dead ends: 4875 [2022-04-15 11:18:06,316 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:06,316 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:06,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-15 11:18:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4873. [2022-04-15 11:18:06,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:06,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 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:06,800 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 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:06,802 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 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:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:07,391 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-15 11:18:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-15 11:18:07,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:07,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:07,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 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 4875 states. [2022-04-15 11:18:07,403 INFO L87 Difference]: Start difference. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 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 4875 states. [2022-04-15 11:18:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:07,993 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-15 11:18:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-15 11:18:07,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:07,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:07,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:07,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 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:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7495 transitions. [2022-04-15 11:18:09,092 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7495 transitions. Word has length 30 [2022-04-15 11:18:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:09,092 INFO L478 AbstractCegarLoop]: Abstraction has 4873 states and 7495 transitions. [2022-04-15 11:18:09,093 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:18:09,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4873 states and 7495 transitions. [2022-04-15 11:18:17,279 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:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7495 transitions. [2022-04-15 11:18:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:18:17,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:17,283 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:17,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:18:17,283 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 1 times [2022-04-15 11:18:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:17,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545057194] [2022-04-15 11:18:17,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 2 times [2022-04-15 11:18:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:17,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49841065] [2022-04-15 11:18:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:17,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:17,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {158571#true} is VALID [2022-04-15 11:18:17,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {158571#true} assume true; {158571#true} is VALID [2022-04-15 11:18:17,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {158571#true} call ULTIMATE.init(); {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:17,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {158571#true} assume true; {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {158571#true} call #t~ret18 := main(); {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {158571#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {158571#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {158571#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {158571#true} assume !(0 != ~p1~0); {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {158571#true} assume !(0 != ~p2~0); {158571#true} is VALID [2022-04-15 11:18:17,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {158571#true} assume !(0 != ~p3~0); {158571#true} is VALID [2022-04-15 11:18:17,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {158571#true} assume !(0 != ~p4~0); {158571#true} is VALID [2022-04-15 11:18:17,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {158571#true} assume !(0 != ~p5~0); {158571#true} is VALID [2022-04-15 11:18:17,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {158571#true} assume !(0 != ~p6~0); {158571#true} is VALID [2022-04-15 11:18:17,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {158571#true} assume 0 != ~p7~0;~lk7~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:17,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {158572#false} is VALID [2022-04-15 11:18:17,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {158572#false} assume 0 != ~p8~0; {158572#false} is VALID [2022-04-15 11:18:17,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {158572#false} assume 1 != ~lk8~0; {158572#false} is VALID [2022-04-15 11:18:17,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {158572#false} assume !false; {158572#false} is VALID [2022-04-15 11:18:17,334 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:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49841065] [2022-04-15 11:18:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49841065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:17,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:17,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:17,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:17,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1545057194] [2022-04-15 11:18:17,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1545057194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:17,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:17,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805489058] [2022-04-15 11:18:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:17,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:17,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:17,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:17,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:17,355 INFO L87 Difference]: Start difference. First operand 4873 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:20,289 INFO L93 Difference]: Finished difference Result 7309 states and 11209 transitions. [2022-04-15 11:18:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-15 11:18:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-15 11:18:20,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-15 11:18:20,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:21,491 INFO L225 Difference]: With dead ends: 7309 [2022-04-15 11:18:21,491 INFO L226 Difference]: Without dead ends: 4939 [2022-04-15 11:18:21,495 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:21,495 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:21,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 125 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-04-15 11:18:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4937. [2022-04-15 11:18:21,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:21,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 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:21,867 INFO L74 IsIncluded]: Start isIncluded. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 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:21,871 INFO L87 Difference]: Start difference. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 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:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:22,541 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-15 11:18:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-15 11:18:22,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:22,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:22,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 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 4939 states. [2022-04-15 11:18:22,556 INFO L87 Difference]: Start difference. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 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 4939 states. [2022-04-15 11:18:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:23,232 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-15 11:18:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-15 11:18:23,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:23,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:23,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:23,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 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:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 7495 transitions. [2022-04-15 11:18:24,373 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 7495 transitions. Word has length 31 [2022-04-15 11:18:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:24,373 INFO L478 AbstractCegarLoop]: Abstraction has 4937 states and 7495 transitions. [2022-04-15 11:18:24,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:24,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4937 states and 7495 transitions. [2022-04-15 11:18:32,496 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:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 7495 transitions. [2022-04-15 11:18:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:18:32,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:32,498 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:32,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:18:32,499 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:32,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 1 times [2022-04-15 11:18:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:32,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170266399] [2022-04-15 11:18:32,500 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 2 times [2022-04-15 11:18:32,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:32,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396057493] [2022-04-15 11:18:32,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:32,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:32,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {192953#true} is VALID [2022-04-15 11:18:32,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {192953#true} assume true; {192953#true} is VALID [2022-04-15 11:18:32,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID [2022-04-15 11:18:32,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {192953#true} call ULTIMATE.init(); {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:32,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {192953#true} is VALID [2022-04-15 11:18:32,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {192953#true} assume true; {192953#true} is VALID [2022-04-15 11:18:32,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {192953#true} call #t~ret18 := main(); {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {192953#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {192953#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {192953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {192953#true} assume !(0 != ~p1~0); {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {192953#true} assume !(0 != ~p2~0); {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {192953#true} assume !(0 != ~p3~0); {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {192953#true} assume !(0 != ~p4~0); {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {192953#true} assume !(0 != ~p5~0); {192953#true} is VALID [2022-04-15 11:18:32,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {192953#true} assume !(0 != ~p6~0); {192953#true} is VALID [2022-04-15 11:18:32,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {192953#true} assume !(0 != ~p7~0); {192953#true} is VALID [2022-04-15 11:18:32,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {192953#true} assume 0 != ~p8~0;~lk8~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p8~0; {192958#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:32,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {192958#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {192954#false} is VALID [2022-04-15 11:18:32,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {192954#false} assume !false; {192954#false} is VALID [2022-04-15 11:18:32,556 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:32,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:32,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396057493] [2022-04-15 11:18:32,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396057493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:32,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:32,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:32,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:32,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170266399] [2022-04-15 11:18:32,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170266399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:32,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:32,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412973137] [2022-04-15 11:18:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:32,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:32,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:32,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:32,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:32,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:32,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:32,577 INFO L87 Difference]: Start difference. First operand 4937 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:36,590 INFO L93 Difference]: Finished difference Result 8717 states and 13513 transitions. [2022-04-15 11:18:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 11:18:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 11:18:36,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-15 11:18:36,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:39,932 INFO L225 Difference]: With dead ends: 8717 [2022-04-15 11:18:39,932 INFO L226 Difference]: Without dead ends: 8715 [2022-04-15 11:18:39,933 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:39,934 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:39,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2022-04-15 11:18:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 7177. [2022-04-15 11:18:40,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:40,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states 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:40,539 INFO L74 IsIncluded]: Start isIncluded. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states 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:40,543 INFO L87 Difference]: Start difference. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states 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:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:42,493 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-15 11:18:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-15 11:18:42,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:42,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:42,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8715 states. [2022-04-15 11:18:42,512 INFO L87 Difference]: Start difference. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8715 states. [2022-04-15 11:18:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:44,569 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-15 11:18:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-15 11:18:44,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:44,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:44,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:44,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states 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,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 10567 transitions. [2022-04-15 11:18:46,827 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 10567 transitions. Word has length 31 [2022-04-15 11:18:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:46,827 INFO L478 AbstractCegarLoop]: Abstraction has 7177 states and 10567 transitions. [2022-04-15 11:18:46,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:46,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7177 states and 10567 transitions. [2022-04-15 11:18:58,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10567 edges. 10567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 10567 transitions. [2022-04-15 11:18:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:18:58,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:58,168 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:58,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:18:58,168 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 1 times [2022-04-15 11:18:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:58,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205660679] [2022-04-15 11:18:58,169 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 2 times [2022-04-15 11:18:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:58,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799983280] [2022-04-15 11:18:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:58,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {242183#true} is VALID [2022-04-15 11:18:58,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {242183#true} assume true; {242183#true} is VALID [2022-04-15 11:18:58,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID [2022-04-15 11:18:58,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {242183#true} call ULTIMATE.init(); {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:58,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {242183#true} is VALID [2022-04-15 11:18:58,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {242183#true} assume true; {242183#true} is VALID [2022-04-15 11:18:58,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID [2022-04-15 11:18:58,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {242183#true} call #t~ret18 := main(); {242183#true} is VALID [2022-04-15 11:18:58,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {242183#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {242183#true} is VALID [2022-04-15 11:18:58,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {242183#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {242183#true} is VALID [2022-04-15 11:18:58,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {242183#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {242183#true} is VALID [2022-04-15 11:18:58,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {242183#true} assume !(0 != ~p1~0); {242183#true} is VALID [2022-04-15 11:18:58,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {242183#true} assume !(0 != ~p2~0); {242183#true} is VALID [2022-04-15 11:18:58,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {242183#true} assume !(0 != ~p3~0); {242183#true} is VALID [2022-04-15 11:18:58,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {242183#true} assume !(0 != ~p4~0); {242183#true} is VALID [2022-04-15 11:18:58,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {242183#true} assume !(0 != ~p5~0); {242183#true} is VALID [2022-04-15 11:18:58,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {242183#true} assume !(0 != ~p6~0); {242183#true} is VALID [2022-04-15 11:18:58,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {242183#true} assume !(0 != ~p7~0); {242183#true} is VALID [2022-04-15 11:18:58,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {242183#true} assume !(0 != ~p8~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p10~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p1~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p2~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p3~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p4~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p5~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p6~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p7~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p8~0; {242184#false} is VALID [2022-04-15 11:18:58,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {242184#false} assume 1 != ~lk8~0; {242184#false} is VALID [2022-04-15 11:18:58,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {242184#false} assume !false; {242184#false} is VALID [2022-04-15 11:18:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:58,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799983280] [2022-04-15 11:18:58,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799983280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:58,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:58,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:58,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:58,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205660679] [2022-04-15 11:18:58,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205660679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:58,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:58,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421036946] [2022-04-15 11:18:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:58,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:58,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:58,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:58,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:58,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:58,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:58,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:58,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:58,240 INFO L87 Difference]: Start difference. First operand 7177 states and 10567 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:10,984 INFO L93 Difference]: Finished difference Result 16653 states and 24649 transitions. [2022-04-15 11:19:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:19:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-15 11:19:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-15 11:19:10,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 225 transitions. [2022-04-15 11:19:11,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:15,045 INFO L225 Difference]: With dead ends: 16653 [2022-04-15 11:19:15,046 INFO L226 Difference]: Without dead ends: 9611 [2022-04-15 11:19:15,053 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:15,054 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:15,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 133 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2022-04-15 11:19:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9609. [2022-04-15 11:19:15,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:15,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states 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:15,798 INFO L74 IsIncluded]: Start isIncluded. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states 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:15,805 INFO L87 Difference]: Start difference. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states 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,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:18,078 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-15 11:19:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-15 11:19:18,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:18,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:18,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9611 states. [2022-04-15 11:19:18,111 INFO L87 Difference]: Start difference. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9611 states. [2022-04-15 11:19:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:20,397 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-15 11:19:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-15 11:19:20,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:20,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:20,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:20,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states 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:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 14087 transitions. [2022-04-15 11:19:24,428 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 14087 transitions. Word has length 31 [2022-04-15 11:19:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:24,428 INFO L478 AbstractCegarLoop]: Abstraction has 9609 states and 14087 transitions. [2022-04-15 11:19:24,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:24,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9609 states and 14087 transitions. [2022-04-15 11:19:40,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 14087 transitions. [2022-04-15 11:19:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:19:40,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:40,245 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:40,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:19:40,245 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 1 times [2022-04-15 11:19:40,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:40,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935302478] [2022-04-15 11:19:40,246 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 2 times [2022-04-15 11:19:40,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:40,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940682174] [2022-04-15 11:19:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:40,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {313941#true} is VALID [2022-04-15 11:19:40,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {313941#true} assume true; {313941#true} is VALID [2022-04-15 11:19:40,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID [2022-04-15 11:19:40,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {313941#true} call ULTIMATE.init(); {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:40,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {313941#true} is VALID [2022-04-15 11:19:40,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {313941#true} assume true; {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {313941#true} call #t~ret18 := main(); {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {313941#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {313941#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {313941#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {313941#true} assume !(0 != ~p1~0); {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {313941#true} assume !(0 != ~p2~0); {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {313941#true} assume !(0 != ~p3~0); {313941#true} is VALID [2022-04-15 11:19:40,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {313941#true} assume !(0 != ~p4~0); {313941#true} is VALID [2022-04-15 11:19:40,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {313941#true} assume !(0 != ~p5~0); {313941#true} is VALID [2022-04-15 11:19:40,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {313941#true} assume !(0 != ~p6~0); {313941#true} is VALID [2022-04-15 11:19:40,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {313941#true} assume !(0 != ~p7~0); {313941#true} is VALID [2022-04-15 11:19:40,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {313941#true} assume 0 != ~p8~0;~lk8~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:40,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {313942#false} is VALID [2022-04-15 11:19:40,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {313942#false} assume 0 != ~p9~0; {313942#false} is VALID [2022-04-15 11:19:40,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {313942#false} assume 1 != ~lk9~0; {313942#false} is VALID [2022-04-15 11:19:40,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {313942#false} assume !false; {313942#false} is VALID [2022-04-15 11:19:40,291 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:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:40,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940682174] [2022-04-15 11:19:40,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940682174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:40,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:40,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:40,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:40,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935302478] [2022-04-15 11:19:40,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935302478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:40,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:40,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:40,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724593706] [2022-04-15 11:19:40,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:40,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:19:40,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:40,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:40,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:40,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:40,313 INFO L87 Difference]: Start difference. First operand 9609 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:50,270 INFO L93 Difference]: Finished difference Result 14413 states and 21065 transitions. [2022-04-15 11:19:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:50,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:19:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-15 11:19:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-15 11:19:50,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-15 11:19:50,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:54,367 INFO L225 Difference]: With dead ends: 14413 [2022-04-15 11:19:54,367 INFO L226 Difference]: Without dead ends: 9739 [2022-04-15 11:19:54,373 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:54,373 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:54,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 122 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2022-04-15 11:19:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 9737. [2022-04-15 11:19:55,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:55,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states 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:55,173 INFO L74 IsIncluded]: Start isIncluded. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states 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:55,182 INFO L87 Difference]: Start difference. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states 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:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:57,622 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-15 11:19:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-15 11:19:57,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:57,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:57,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9739 states. [2022-04-15 11:19:57,644 INFO L87 Difference]: Start difference. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9739 states. [2022-04-15 11:20:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:00,182 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-15 11:20:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-15 11:20:00,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:00,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:00,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:00,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states 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:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 14087 transitions. [2022-04-15 11:20:04,166 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 14087 transitions. Word has length 32 [2022-04-15 11:20:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:04,166 INFO L478 AbstractCegarLoop]: Abstraction has 9737 states and 14087 transitions. [2022-04-15 11:20:04,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:04,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9737 states and 14087 transitions. [2022-04-15 11:20:19,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 14087 transitions. [2022-04-15 11:20:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:20:19,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:20:19,807 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:20:19,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:20:19,808 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:20:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:20:19,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 1 times [2022-04-15 11:20:19,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:19,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [354766724] [2022-04-15 11:20:19,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:20:19,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 2 times [2022-04-15 11:20:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:20:19,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23825443] [2022-04-15 11:20:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:20:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:20:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:20:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:19,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {381731#true} is VALID [2022-04-15 11:20:19,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {381731#true} assume true; {381731#true} is VALID [2022-04-15 11:20:19,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID [2022-04-15 11:20:19,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {381731#true} call ULTIMATE.init(); {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:20:19,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {381731#true} is VALID [2022-04-15 11:20:19,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {381731#true} assume true; {381731#true} is VALID [2022-04-15 11:20:19,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID [2022-04-15 11:20:19,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {381731#true} call #t~ret18 := main(); {381731#true} is VALID [2022-04-15 11:20:19,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {381731#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {381731#true} is VALID [2022-04-15 11:20:19,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {381731#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {381731#true} is VALID [2022-04-15 11:20:19,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {381731#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {381731#true} is VALID [2022-04-15 11:20:19,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {381731#true} assume !(0 != ~p1~0); {381731#true} is VALID [2022-04-15 11:20:19,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {381731#true} assume !(0 != ~p2~0); {381731#true} is VALID [2022-04-15 11:20:19,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {381731#true} assume !(0 != ~p3~0); {381731#true} is VALID [2022-04-15 11:20:19,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {381731#true} assume !(0 != ~p4~0); {381731#true} is VALID [2022-04-15 11:20:19,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {381731#true} assume !(0 != ~p5~0); {381731#true} is VALID [2022-04-15 11:20:19,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {381731#true} assume !(0 != ~p6~0); {381731#true} is VALID [2022-04-15 11:20:19,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {381731#true} assume !(0 != ~p7~0); {381731#true} is VALID [2022-04-15 11:20:19,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {381731#true} assume !(0 != ~p8~0); {381731#true} is VALID [2022-04-15 11:20:19,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {381731#true} assume 0 != ~p9~0;~lk9~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p9~0; {381736#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:19,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {381736#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {381732#false} is VALID [2022-04-15 11:20:19,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {381732#false} assume !false; {381732#false} is VALID [2022-04-15 11:20:19,856 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:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:20:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23825443] [2022-04-15 11:20:19,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23825443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:19,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:19,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:19,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:20:19,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [354766724] [2022-04-15 11:20:19,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [354766724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:19,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:19,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697525098] [2022-04-15 11:20:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:20:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:20:19,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:20:19,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:19,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:19,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:20:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:20:19,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:20:19,879 INFO L87 Difference]: Start difference. First operand 9737 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:33,835 INFO L93 Difference]: Finished difference Result 16909 states and 24969 transitions. [2022-04-15 11:20:33,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:20:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:20:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:20:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 11:20:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 11:20:33,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-15 11:20:33,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:46,470 INFO L225 Difference]: With dead ends: 16909 [2022-04-15 11:20:46,471 INFO L226 Difference]: Without dead ends: 16907 [2022-04-15 11:20:46,474 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:46,474 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:20:46,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:20:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states. [2022-04-15 11:20:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 14345. [2022-04-15 11:20:47,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:20:47,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states 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:47,641 INFO L74 IsIncluded]: Start isIncluded. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states 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:47,657 INFO L87 Difference]: Start difference. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states 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:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:55,017 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-15 11:20:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-15 11:20:55,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:55,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:55,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16907 states. [2022-04-15 11:20:55,069 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16907 states. [2022-04-15 11:21:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:02,198 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-15 11:21:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-15 11:21:02,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:21:02,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:21:02,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:21:02,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:21:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states 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:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 20103 transitions. [2022-04-15 11:21:11,480 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 20103 transitions. Word has length 32 [2022-04-15 11:21:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:21:11,480 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 20103 transitions. [2022-04-15 11:21:11,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:11,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 20103 transitions. [2022-04-15 11:21:33,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20103 edges. 20103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:21:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 20103 transitions. [2022-04-15 11:21:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:21:33,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:21:33,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, 1, 1, 1, 1, 1] [2022-04-15 11:21:33,917 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:21:33,917 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:21:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:21:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 1 times [2022-04-15 11:21:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:21:33,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456131438] [2022-04-15 11:21:33,917 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:21:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 2 times [2022-04-15 11:21:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:21:33,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277834501] [2022-04-15 11:21:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:21:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:21:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:21:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:21:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:21:33,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {478065#true} is VALID [2022-04-15 11:21:33,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {478065#true} assume true; {478065#true} is VALID [2022-04-15 11:21:33,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID [2022-04-15 11:21:33,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {478065#true} call ULTIMATE.init(); {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:21:33,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {478065#true} is VALID [2022-04-15 11:21:33,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {478065#true} assume true; {478065#true} is VALID [2022-04-15 11:21:33,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID [2022-04-15 11:21:33,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {478065#true} call #t~ret18 := main(); {478065#true} is VALID [2022-04-15 11:21:33,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {478065#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {478065#true} is VALID [2022-04-15 11:21:33,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {478065#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {478065#true} is VALID [2022-04-15 11:21:33,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {478065#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {478065#true} is VALID [2022-04-15 11:21:33,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {478065#true} assume !(0 != ~p1~0); {478065#true} is VALID [2022-04-15 11:21:33,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {478065#true} assume !(0 != ~p2~0); {478065#true} is VALID [2022-04-15 11:21:33,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {478065#true} assume !(0 != ~p3~0); {478065#true} is VALID [2022-04-15 11:21:33,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {478065#true} assume !(0 != ~p4~0); {478065#true} is VALID [2022-04-15 11:21:33,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {478065#true} assume !(0 != ~p5~0); {478065#true} is VALID [2022-04-15 11:21:33,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {478065#true} assume !(0 != ~p6~0); {478065#true} is VALID [2022-04-15 11:21:33,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {478065#true} assume !(0 != ~p7~0); {478065#true} is VALID [2022-04-15 11:21:33,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {478065#true} assume !(0 != ~p8~0); {478065#true} is VALID [2022-04-15 11:21:33,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {478065#true} assume !(0 != ~p9~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p10~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p1~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p2~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p3~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p4~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p5~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p6~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p7~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p8~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:33,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p9~0; {478066#false} is VALID [2022-04-15 11:21:33,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {478066#false} assume 1 != ~lk9~0; {478066#false} is VALID [2022-04-15 11:21:33,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {478066#false} assume !false; {478066#false} is VALID [2022-04-15 11:21:33,968 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:21:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:21:33,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277834501] [2022-04-15 11:21:33,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277834501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:21:33,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:21:33,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:21:33,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:21:33,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456131438] [2022-04-15 11:21:33,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456131438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:21:33,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:21:33,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:21:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294764321] [2022-04-15 11:21:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:21:33,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:21:33,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:21:33,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:33,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:21:33,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:21:33,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:21:33,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:21:33,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:21:33,990 INFO L87 Difference]: Start difference. First operand 14345 states and 20103 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:22:27,786 INFO L93 Difference]: Finished difference Result 33037 states and 46473 transitions. [2022-04-15 11:22:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:22:27,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:22:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:22:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 11:22:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:22:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 11:22:27,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-15 11:22:27,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:22:42,758 INFO L225 Difference]: With dead ends: 33037 [2022-04-15 11:22:42,758 INFO L226 Difference]: Without dead ends: 18955 [2022-04-15 11:22:42,779 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:22:42,779 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:22:42,780 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 135 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:22:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2022-04-15 11:22:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 18953. [2022-04-15 11:22:44,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:22:44,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states 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:44,386 INFO L74 IsIncluded]: Start isIncluded. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states 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:44,414 INFO L87 Difference]: Start difference. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states 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:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:22:53,490 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-15 11:22:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-15 11:22:53,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:22:53,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:22:53,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18955 states. [2022-04-15 11:22:53,553 INFO L87 Difference]: Start difference. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18955 states. [2022-04-15 11:23:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:03,179 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-15 11:23:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-15 11:23:03,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:23:03,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:23:03,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:23:03,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:23:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states 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:23:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18953 states to 18953 states and 26375 transitions. [2022-04-15 11:23:18,606 INFO L78 Accepts]: Start accepts. Automaton has 18953 states and 26375 transitions. Word has length 32 [2022-04-15 11:23:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:23:18,606 INFO L478 AbstractCegarLoop]: Abstraction has 18953 states and 26375 transitions. [2022-04-15 11:23:18,606 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:18,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18953 states and 26375 transitions. [2022-04-15 11:23:49,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:23:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 18953 states and 26375 transitions. [2022-04-15 11:23:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:23:49,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:23:49,487 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:23:49,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:23:49,487 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:23:49,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:23:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 1 times [2022-04-15 11:23:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:23:49,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634723364] [2022-04-15 11:23:49,488 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:23:49,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 2 times [2022-04-15 11:23:49,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:23:49,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266981857] [2022-04-15 11:23:49,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:23:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:23:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:23:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:23:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:23:49,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {619967#true} is VALID [2022-04-15 11:23:49,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {619967#true} assume true; {619967#true} is VALID [2022-04-15 11:23:49,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID [2022-04-15 11:23:49,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {619967#true} call ULTIMATE.init(); {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:23:49,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {619967#true} is VALID [2022-04-15 11:23:49,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {619967#true} assume true; {619967#true} is VALID [2022-04-15 11:23:49,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID [2022-04-15 11:23:49,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {619967#true} call #t~ret18 := main(); {619967#true} is VALID [2022-04-15 11:23:49,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {619967#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {619967#true} is VALID [2022-04-15 11:23:49,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {619967#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {619967#true} is VALID [2022-04-15 11:23:49,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {619967#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {619967#true} is VALID [2022-04-15 11:23:49,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {619967#true} assume !(0 != ~p1~0); {619967#true} is VALID [2022-04-15 11:23:49,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {619967#true} assume !(0 != ~p2~0); {619967#true} is VALID [2022-04-15 11:23:49,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {619967#true} assume !(0 != ~p3~0); {619967#true} is VALID [2022-04-15 11:23:49,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {619967#true} assume !(0 != ~p4~0); {619967#true} is VALID [2022-04-15 11:23:49,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {619967#true} assume !(0 != ~p5~0); {619967#true} is VALID [2022-04-15 11:23:49,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {619967#true} assume !(0 != ~p6~0); {619967#true} is VALID [2022-04-15 11:23:49,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {619967#true} assume !(0 != ~p7~0); {619967#true} is VALID [2022-04-15 11:23:49,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {619967#true} assume !(0 != ~p8~0); {619967#true} is VALID [2022-04-15 11:23:49,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {619967#true} assume 0 != ~p9~0;~lk9~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:23:49,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {619968#false} is VALID [2022-04-15 11:23:49,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {619968#false} assume 0 != ~p10~0; {619968#false} is VALID [2022-04-15 11:23:49,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {619968#false} assume 1 != ~lk10~0; {619968#false} is VALID [2022-04-15 11:23:49,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {619968#false} assume !false; {619968#false} is VALID [2022-04-15 11:23:49,529 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:23:49,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:23:49,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266981857] [2022-04-15 11:23:49,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266981857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:23:49,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:23:49,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:23:49,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:23:49,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634723364] [2022-04-15 11:23:49,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634723364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:23:49,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:23:49,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:23:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815526626] [2022-04-15 11:23:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:23:49,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:23:49,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:23:49,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:49,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:23:49,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:23:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:23:49,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:23:49,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:23:49,550 INFO L87 Difference]: Start difference. First operand 18953 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:24:31,928 INFO L93 Difference]: Finished difference Result 28429 states and 39433 transitions. [2022-04-15 11:24:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:24:31,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:24:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:24:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-15 11:24:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-15 11:24:31,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-15 11:24:32,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:48,428 INFO L225 Difference]: With dead ends: 28429 [2022-04-15 11:24:48,429 INFO L226 Difference]: Without dead ends: 19211 [2022-04-15 11:24:48,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:24:48,442 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 119 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:24:48,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:24:48,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states. [2022-04-15 11:24:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19209. [2022-04-15 11:24:50,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:24:50,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states 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,285 INFO L74 IsIncluded]: Start isIncluded. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states 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,310 INFO L87 Difference]: Start difference. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states 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:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:00,803 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-15 11:25:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-15 11:25:00,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:25:00,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:25:00,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19211 states. [2022-04-15 11:25:00,857 INFO L87 Difference]: Start difference. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19211 states. [2022-04-15 11:25:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:11,309 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-15 11:25:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-15 11:25:11,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:25:11,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:25:11,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:25:11,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:25:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states 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,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 26375 transitions. [2022-04-15 11:25:26,975 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 26375 transitions. Word has length 33 [2022-04-15 11:25:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:25:26,976 INFO L478 AbstractCegarLoop]: Abstraction has 19209 states and 26375 transitions. [2022-04-15 11:25:26,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:26,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19209 states and 26375 transitions. [2022-04-15 11:25:57,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:25:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 26375 transitions. [2022-04-15 11:25:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:25:57,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:25:57,825 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:25:57,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:25:57,825 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:25:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:25:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 1 times [2022-04-15 11:25:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:25:57,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633877167] [2022-04-15 11:25:57,826 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:25:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 2 times [2022-04-15 11:25:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:25:57,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647066421] [2022-04-15 11:25:57,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:25:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:25:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:25:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:25:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:25:57,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {753677#true} is VALID [2022-04-15 11:25:57,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {753677#true} assume true; {753677#true} is VALID [2022-04-15 11:25:57,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID [2022-04-15 11:25:57,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {753677#true} call ULTIMATE.init(); {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:25:57,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {753677#true} is VALID [2022-04-15 11:25:57,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {753677#true} assume true; {753677#true} is VALID [2022-04-15 11:25:57,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID [2022-04-15 11:25:57,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {753677#true} call #t~ret18 := main(); {753677#true} is VALID [2022-04-15 11:25:57,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {753677#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {753677#true} is VALID [2022-04-15 11:25:57,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {753677#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {753677#true} is VALID [2022-04-15 11:25:57,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {753677#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {753677#true} is VALID [2022-04-15 11:25:57,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {753677#true} assume !(0 != ~p1~0); {753677#true} is VALID [2022-04-15 11:25:57,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {753677#true} assume !(0 != ~p2~0); {753677#true} is VALID [2022-04-15 11:25:57,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {753677#true} assume !(0 != ~p3~0); {753677#true} is VALID [2022-04-15 11:25:57,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {753677#true} assume !(0 != ~p4~0); {753677#true} is VALID [2022-04-15 11:25:57,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {753677#true} assume !(0 != ~p5~0); {753677#true} is VALID [2022-04-15 11:25:57,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {753677#true} assume !(0 != ~p6~0); {753677#true} is VALID [2022-04-15 11:25:57,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {753677#true} assume !(0 != ~p7~0); {753677#true} is VALID [2022-04-15 11:25:57,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {753677#true} assume !(0 != ~p8~0); {753677#true} is VALID [2022-04-15 11:25:57,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {753677#true} assume !(0 != ~p9~0); {753677#true} is VALID [2022-04-15 11:25:57,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {753677#true} assume !(0 != ~p10~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p1~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p2~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p3~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p4~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p5~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p6~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p7~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p8~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p9~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-15 11:25:57,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p10~0; {753678#false} is VALID [2022-04-15 11:25:57,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {753678#false} assume 1 != ~lk10~0; {753678#false} is VALID [2022-04-15 11:25:57,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {753678#false} assume !false; {753678#false} is VALID [2022-04-15 11:25:57,868 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:57,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:25:57,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647066421] [2022-04-15 11:25:57,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647066421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:25:57,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:25:57,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:25:57,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:25:57,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633877167] [2022-04-15 11:25:57,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633877167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:25:57,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:25:57,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:25:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89997171] [2022-04-15 11:25:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:25:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:25:57,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:25:57,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:57,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:25:57,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:25:57,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:25:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:25:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:25:57,891 INFO L87 Difference]: Start difference. First operand 19209 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)