/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:00:21,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:00:21,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:00:21,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:00:21,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:00:21,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:00:21,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:00:21,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:00:21,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:00:21,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:00:21,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:00:21,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:00:21,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:00:21,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:00:21,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:00:21,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:00:21,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:00:21,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:00:21,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:00:21,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:00:21,549 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:00:21,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:00:21,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:00:21,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:00:21,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:00:21,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:00:21,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:00:21,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:00:21,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:00:21,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:00:21,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:00:21,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:00:21,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:00:21,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:00:21,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:00:21,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:00:21,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:00:21,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:00:21,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:00:21,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:00:21,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:00:21,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:00:21,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:00:21,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:00:21,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:00:21,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:00:21,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:00:21,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:00:21,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:00:21,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:00:21,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:00:21,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:00:21,575 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:00:21,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:00:21,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:00:21,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:00:21,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:00:21,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:00:21,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:00:21,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:00:21,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:00:21,576 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:00:21,576 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:00:21,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:00:21,576 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:00:21,576 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-28 15:00:21,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:00:21,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:00:21,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:00:21,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:00:21,749 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:00:21,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-28 15:00:21,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f33297e1/d025c90abc5b479aa07e10d9d65ca395/FLAGedf2bfc06 [2022-04-28 15:00:22,133 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:00:22,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-28 15:00:22,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f33297e1/d025c90abc5b479aa07e10d9d65ca395/FLAGedf2bfc06 [2022-04-28 15:00:22,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f33297e1/d025c90abc5b479aa07e10d9d65ca395 [2022-04-28 15:00:22,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:00:22,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:00:22,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:00:22,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:00:22,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:00:22,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d991237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22, skipping insertion in model container [2022-04-28 15:00:22,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:00:22,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:00:22,319 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_14-1.c[5283,5296] [2022-04-28 15:00:22,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:00:22,328 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:00:22,351 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_14-1.c[5283,5296] [2022-04-28 15:00:22,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:00:22,360 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:00:22,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22 WrapperNode [2022-04-28 15:00:22,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:00:22,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:00:22,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:00:22,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:00:22,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:00:22,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:00:22,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:00:22,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:00:22,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (1/1) ... [2022-04-28 15:00:22,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:00:22,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:00:22,415 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-28 15:00:22,431 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-28 15:00:22,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:00:22,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:00:22,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:00:22,440 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:00:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:00:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:00:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:00:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:00:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:00:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:00:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:00:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:00:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:00:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:00:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:00:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:00:22,509 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:00:22,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:00:22,787 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:00:22,792 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:00:22,792 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:00:22,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:00:22 BoogieIcfgContainer [2022-04-28 15:00:22,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:00:22,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:00:22,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:00:22,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:00:22,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:00:22" (1/3) ... [2022-04-28 15:00:22,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f37557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:00:22, skipping insertion in model container [2022-04-28 15:00:22,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:22" (2/3) ... [2022-04-28 15:00:22,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f37557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:00:22, skipping insertion in model container [2022-04-28 15:00:22,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:00:22" (3/3) ... [2022-04-28 15:00:22,812 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-04-28 15:00:22,824 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:00:22,824 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:00:22,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:00:22,856 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74c38547, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5990c8c0 [2022-04-28 15:00:22,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:00:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 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-28 15:00:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 15:00:22,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:22,868 INFO L195 NwaCegarLoop]: 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-28 15:00:22,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:22,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 1 times [2022-04-28 15:00:22,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:22,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276900754] [2022-04-28 15:00:22,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 2 times [2022-04-28 15:00:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:22,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811340345] [2022-04-28 15:00:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:22,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:23,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-28 15:00:23,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-28 15:00:23,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-28 15:00:23,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:23,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-28 15:00:23,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-28 15:00:23,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-28 15:00:23,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2022-04-28 15:00:23,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {60#true} is VALID [2022-04-28 15:00:23,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {60#true} is VALID [2022-04-28 15:00:23,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {60#true} is VALID [2022-04-28 15:00:23,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} assume 0 != ~p1~0;~lk1~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p1~0; {65#(= main_~lk1~0 1)} is VALID [2022-04-28 15:00:23,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {65#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {61#false} is VALID [2022-04-28 15:00:23,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-04-28 15:00:23,085 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-28 15:00:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:23,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811340345] [2022-04-28 15:00:23,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811340345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:23,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:23,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:23,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:23,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276900754] [2022-04-28 15:00:23,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276900754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:23,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:23,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:23,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547926302] [2022-04-28 15:00:23,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:23,094 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-28 15:00:23,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:23,097 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-28 15:00:23,127 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-28 15:00:23,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:23,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:23,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:23,150 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 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.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-28 15:00:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:23,449 INFO L93 Difference]: Finished difference Result 112 states and 199 transitions. [2022-04-28 15:00:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:23,449 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-28 15:00:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:23,450 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-28 15:00:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 15:00:23,458 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-28 15:00:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 15:00:23,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-28 15:00:23,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:23,624 INFO L225 Difference]: With dead ends: 112 [2022-04-28 15:00:23,625 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 15:00:23,626 INFO L412 NwaCegarLoop]: 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-28 15:00:23,628 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:23,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 113 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:00:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 15:00:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2022-04-28 15:00:23,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:23,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:23,656 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:23,656 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:23,661 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-28 15:00:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-28 15:00:23,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:23,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:23,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 15:00:23,662 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 15:00:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:23,667 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-28 15:00:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-28 15:00:23,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:23,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:23,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:23,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-04-28 15:00:23,671 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2022-04-28 15:00:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:23,671 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-04-28 15:00:23,672 INFO L496 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-28 15:00:23,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 122 transitions. [2022-04-28 15:00:23,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-04-28 15:00:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 15:00:23,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:23,767 INFO L195 NwaCegarLoop]: 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-28 15:00:23,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:00:23,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 1 times [2022-04-28 15:00:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:23,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317280134] [2022-04-28 15:00:23,769 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 2 times [2022-04-28 15:00:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:23,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005490530] [2022-04-28 15:00:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:23,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-28 15:00:23,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-28 15:00:23,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-28 15:00:23,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:23,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-28 15:00:23,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-28 15:00:23,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-28 15:00:23,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret19 := main(); {624#true} is VALID [2022-04-28 15:00:23,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {624#true} is VALID [2022-04-28 15:00:23,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {624#true} is VALID [2022-04-28 15:00:23,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {624#true} is VALID [2022-04-28 15:00:23,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#true} assume !(0 != ~p1~0); {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p2~0); {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p10~0); {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-28 15:00:23,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p1~0; {625#false} is VALID [2022-04-28 15:00:23,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {625#false} assume 1 != ~lk1~0; {625#false} is VALID [2022-04-28 15:00:23,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-28 15:00:23,846 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-28 15:00:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:23,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005490530] [2022-04-28 15:00:23,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005490530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:23,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:23,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:23,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:23,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317280134] [2022-04-28 15:00:23,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317280134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:23,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:23,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:23,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696049082] [2022-04-28 15:00:23,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:23,848 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-28 15:00:23,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:23,849 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-28 15:00:23,864 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-28 15:00:23,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:23,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:23,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:23,865 INFO L87 Difference]: Start difference. First operand 67 states and 122 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-28 15:00:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:24,076 INFO L93 Difference]: Finished difference Result 158 states and 293 transitions. [2022-04-28 15:00:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:24,076 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-28 15:00:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:24,076 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-28 15:00:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-28 15:00:24,079 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-28 15:00:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-28 15:00:24,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-28 15:00:24,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:24,263 INFO L225 Difference]: With dead ends: 158 [2022-04-28 15:00:24,263 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 15:00:24,264 INFO L412 NwaCegarLoop]: 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-28 15:00:24,264 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:24,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 127 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:00:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 15:00:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-28 15:00:24,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:24,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,275 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,275 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:24,278 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-28 15:00:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-28 15:00:24,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:24,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:24,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 15:00:24,280 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 15:00:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:24,282 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-28 15:00:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-28 15:00:24,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:24,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:24,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:24,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 174 transitions. [2022-04-28 15:00:24,286 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 174 transitions. Word has length 25 [2022-04-28 15:00:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:24,287 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 174 transitions. [2022-04-28 15:00:24,287 INFO L496 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-28 15:00:24,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 174 transitions. [2022-04-28 15:00:24,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 174 transitions. [2022-04-28 15:00:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:00:24,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:24,428 INFO L195 NwaCegarLoop]: 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-28 15:00:24,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:00:24,428 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 1 times [2022-04-28 15:00:24,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:24,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [362138960] [2022-04-28 15:00:24,429 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 2 times [2022-04-28 15:00:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:24,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141637690] [2022-04-28 15:00:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:24,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1336#true} is VALID [2022-04-28 15:00:24,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-28 15:00:24,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-28 15:00:24,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {1336#true} call ULTIMATE.init(); {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:24,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1336#true} is VALID [2022-04-28 15:00:24,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-28 15:00:24,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-28 15:00:24,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {1336#true} call #t~ret19 := main(); {1336#true} is VALID [2022-04-28 15:00:24,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {1336#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {1336#true} is VALID [2022-04-28 15:00:24,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {1336#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {1336#true} is VALID [2022-04-28 15:00:24,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {1336#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {1336#true} is VALID [2022-04-28 15:00:24,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {1336#true} assume 0 != ~p1~0;~lk1~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:00:24,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1337#false} is VALID [2022-04-28 15:00:24,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {1337#false} assume 0 != ~p2~0; {1337#false} is VALID [2022-04-28 15:00:24,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {1337#false} assume 1 != ~lk2~0; {1337#false} is VALID [2022-04-28 15:00:24,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#false} assume !false; {1337#false} is VALID [2022-04-28 15:00:24,492 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-28 15:00:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:24,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141637690] [2022-04-28 15:00:24,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141637690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:24,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:24,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:24,493 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:24,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [362138960] [2022-04-28 15:00:24,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [362138960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:24,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:24,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506933827] [2022-04-28 15:00:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:24,493 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-28 15:00:24,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:24,494 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-28 15:00:24,508 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-28 15:00:24,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:24,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:24,509 INFO L87 Difference]: Start difference. First operand 95 states and 174 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-28 15:00:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:24,692 INFO L93 Difference]: Finished difference Result 145 states and 262 transitions. [2022-04-28 15:00:24,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:24,693 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-28 15:00:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:24,693 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-28 15:00:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-28 15:00:24,695 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-28 15:00:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-28 15:00:24,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-28 15:00:24,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:24,840 INFO L225 Difference]: With dead ends: 145 [2022-04-28 15:00:24,840 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 15:00:24,841 INFO L412 NwaCegarLoop]: 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-28 15:00:24,841 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:24,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 153 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 15:00:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-28 15:00:24,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:24,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,850 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,850 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:24,852 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-28 15:00:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-28 15:00:24,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:24,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:24,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 15:00:24,854 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 15:00:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:24,856 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-28 15:00:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-28 15:00:24,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:24,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:24,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:24,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2022-04-28 15:00:24,859 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 26 [2022-04-28 15:00:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:24,859 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2022-04-28 15:00:24,860 INFO L496 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-28 15:00:24,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 176 transitions. [2022-04-28 15:00:24,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2022-04-28 15:00:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:00:24,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:24,979 INFO L195 NwaCegarLoop]: 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-28 15:00:24,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:00:24,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 1 times [2022-04-28 15:00:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:24,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1502016955] [2022-04-28 15:00:24,983 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 2 times [2022-04-28 15:00:24,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:24,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351241954] [2022-04-28 15:00:24,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:25,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:25,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2034#true} is VALID [2022-04-28 15:00:25,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-28 15:00:25,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-28 15:00:25,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:25,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2034#true} is VALID [2022-04-28 15:00:25,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-28 15:00:25,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-28 15:00:25,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret19 := main(); {2034#true} is VALID [2022-04-28 15:00:25,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {2034#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {2034#true} is VALID [2022-04-28 15:00:25,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {2034#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {2034#true} is VALID [2022-04-28 15:00:25,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2034#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {2034#true} is VALID [2022-04-28 15:00:25,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {2034#true} assume !(0 != ~p1~0); {2034#true} is VALID [2022-04-28 15:00:25,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {2034#true} assume !(0 != ~p2~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-28 15:00:25,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p2~0; {2035#false} is VALID [2022-04-28 15:00:25,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {2035#false} assume 1 != ~lk2~0; {2035#false} is VALID [2022-04-28 15:00:25,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2022-04-28 15:00:25,069 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-28 15:00:25,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:25,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351241954] [2022-04-28 15:00:25,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351241954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:25,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:25,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:25,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:25,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1502016955] [2022-04-28 15:00:25,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1502016955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:25,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:25,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:25,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497662151] [2022-04-28 15:00:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:25,071 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-28 15:00:25,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:25,071 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-28 15:00:25,086 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-28 15:00:25,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:25,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:25,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:25,087 INFO L87 Difference]: Start difference. First operand 98 states and 176 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-28 15:00:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:25,271 INFO L93 Difference]: Finished difference Result 274 states and 504 transitions. [2022-04-28 15:00:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:25,272 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-28 15:00:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:25,273 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-28 15:00:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-28 15:00:25,276 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-28 15:00:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-28 15:00:25,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-28 15:00:25,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:25,436 INFO L225 Difference]: With dead ends: 274 [2022-04-28 15:00:25,436 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 15:00:25,437 INFO L412 NwaCegarLoop]: 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-28 15:00:25,440 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:25,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 103 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 15:00:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-28 15:00:25,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:25,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:25,462 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:25,463 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:25,468 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-28 15:00:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-28 15:00:25,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:25,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:25,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-28 15:00:25,469 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-28 15:00:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:25,474 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-28 15:00:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-28 15:00:25,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:25,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:25,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:25,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 333 transitions. [2022-04-28 15:00:25,480 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 333 transitions. Word has length 26 [2022-04-28 15:00:25,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:25,480 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 333 transitions. [2022-04-28 15:00:25,480 INFO L496 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-28 15:00:25,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 333 transitions. [2022-04-28 15:00:25,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 333 transitions. [2022-04-28 15:00:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:00:25,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:25,704 INFO L195 NwaCegarLoop]: 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-28 15:00:25,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:00:25,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 1 times [2022-04-28 15:00:25,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:25,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241373468] [2022-04-28 15:00:25,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 2 times [2022-04-28 15:00:25,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:25,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939050747] [2022-04-28 15:00:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:25,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:25,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3330#true} is VALID [2022-04-28 15:00:25,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-28 15:00:25,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-28 15:00:25,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {3330#true} call ULTIMATE.init(); {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:25,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3330#true} is VALID [2022-04-28 15:00:25,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-28 15:00:25,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-28 15:00:25,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {3330#true} call #t~ret19 := main(); {3330#true} is VALID [2022-04-28 15:00:25,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {3330#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {3330#true} is VALID [2022-04-28 15:00:25,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {3330#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {3330#true} is VALID [2022-04-28 15:00:25,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {3330#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {3330#true} is VALID [2022-04-28 15:00:25,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {3330#true} assume !(0 != ~p1~0); {3330#true} is VALID [2022-04-28 15:00:25,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {3330#true} assume 0 != ~p2~0;~lk2~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3335#(= main_~lk2~0 1)} is VALID [2022-04-28 15:00:25,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {3335#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3331#false} is VALID [2022-04-28 15:00:25,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {3331#false} assume !false; {3331#false} is VALID [2022-04-28 15:00:25,787 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-28 15:00:25,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:25,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939050747] [2022-04-28 15:00:25,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939050747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:25,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:25,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:25,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:25,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241373468] [2022-04-28 15:00:25,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241373468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:25,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:25,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827567866] [2022-04-28 15:00:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:25,788 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-28 15:00:25,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:25,788 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-28 15:00:25,803 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-28 15:00:25,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:25,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:25,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:25,804 INFO L87 Difference]: Start difference. First operand 183 states and 333 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-28 15:00:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:25,984 INFO L93 Difference]: Finished difference Result 239 states and 435 transitions. [2022-04-28 15:00:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:25,984 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-28 15:00:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:25,984 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-28 15:00:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 15:00:25,986 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-28 15:00:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 15:00:25,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-28 15:00:26,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:26,094 INFO L225 Difference]: With dead ends: 239 [2022-04-28 15:00:26,094 INFO L226 Difference]: Without dead ends: 237 [2022-04-28 15:00:26,094 INFO L412 NwaCegarLoop]: 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-28 15:00:26,095 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:26,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-28 15:00:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 183. [2022-04-28 15:00:26,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:26,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:26,105 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:26,105 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:26,110 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-28 15:00:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-28 15:00:26,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:26,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:26,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-28 15:00:26,111 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-28 15:00:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:26,116 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-28 15:00:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-28 15:00:26,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:26,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:26,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:26,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 331 transitions. [2022-04-28 15:00:26,121 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 331 transitions. Word has length 26 [2022-04-28 15:00:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:26,121 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 331 transitions. [2022-04-28 15:00:26,121 INFO L496 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-28 15:00:26,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 331 transitions. [2022-04-28 15:00:26,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 331 transitions. [2022-04-28 15:00:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 15:00:26,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:26,373 INFO L195 NwaCegarLoop]: 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-28 15:00:26,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:00:26,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 1 times [2022-04-28 15:00:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:26,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042460346] [2022-04-28 15:00:26,374 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 2 times [2022-04-28 15:00:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:26,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558009924] [2022-04-28 15:00:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:26,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4660#true} is VALID [2022-04-28 15:00:26,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-28 15:00:26,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-28 15:00:26,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {4660#true} call ULTIMATE.init(); {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:26,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4660#true} is VALID [2022-04-28 15:00:26,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-28 15:00:26,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-28 15:00:26,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {4660#true} call #t~ret19 := main(); {4660#true} is VALID [2022-04-28 15:00:26,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {4660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {4660#true} is VALID [2022-04-28 15:00:26,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {4660#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {4660#true} is VALID [2022-04-28 15:00:26,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {4660#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {4660#true} is VALID [2022-04-28 15:00:26,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {4660#true} assume !(0 != ~p1~0); {4660#true} is VALID [2022-04-28 15:00:26,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {4660#true} assume !(0 != ~p2~0); {4660#true} is VALID [2022-04-28 15:00:26,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {4660#true} assume 0 != ~p3~0;~lk3~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4665#(= main_~lk3~0 1)} is VALID [2022-04-28 15:00:26,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {4665#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4661#false} is VALID [2022-04-28 15:00:26,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {4661#false} assume !false; {4661#false} is VALID [2022-04-28 15:00:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:00:26,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558009924] [2022-04-28 15:00:26,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558009924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:26,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:26,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:26,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:26,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2042460346] [2022-04-28 15:00:26,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2042460346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:26,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:26,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835704384] [2022-04-28 15:00:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:26,420 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-28 15:00:26,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:26,420 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-28 15:00:26,435 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-28 15:00:26,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:26,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:26,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:26,436 INFO L87 Difference]: Start difference. First operand 183 states and 331 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-28 15:00:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:26,623 INFO L93 Difference]: Finished difference Result 347 states and 635 transitions. [2022-04-28 15:00:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:26,623 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-28 15:00:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:26,623 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-28 15:00:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 15:00:26,625 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-28 15:00:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 15:00:26,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-28 15:00:26,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:26,742 INFO L225 Difference]: With dead ends: 347 [2022-04-28 15:00:26,742 INFO L226 Difference]: Without dead ends: 345 [2022-04-28 15:00:26,742 INFO L412 NwaCegarLoop]: 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-28 15:00:26,743 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 222 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:26,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-28 15:00:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 247. [2022-04-28 15:00:26,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:26,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:26,755 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:26,756 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:26,762 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-28 15:00:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-28 15:00:26,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:26,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:26,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-28 15:00:26,764 INFO L87 Difference]: Start difference. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-28 15:00:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:26,769 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-28 15:00:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-28 15:00:26,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:26,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:26,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:26,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 445 transitions. [2022-04-28 15:00:26,775 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 445 transitions. Word has length 27 [2022-04-28 15:00:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:26,775 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 445 transitions. [2022-04-28 15:00:26,775 INFO L496 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-28 15:00:26,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 445 transitions. [2022-04-28 15:00:27,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 445 transitions. [2022-04-28 15:00:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 15:00:27,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:27,150 INFO L195 NwaCegarLoop]: 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-28 15:00:27,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:00:27,150 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:27,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 1 times [2022-04-28 15:00:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:27,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101189208] [2022-04-28 15:00:27,150 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 2 times [2022-04-28 15:00:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:27,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094812650] [2022-04-28 15:00:27,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:27,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:27,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6550#true} is VALID [2022-04-28 15:00:27,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-28 15:00:27,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-28 15:00:27,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {6550#true} call ULTIMATE.init(); {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:27,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6550#true} is VALID [2022-04-28 15:00:27,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-28 15:00:27,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-28 15:00:27,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {6550#true} call #t~ret19 := main(); {6550#true} is VALID [2022-04-28 15:00:27,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {6550#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {6550#true} is VALID [2022-04-28 15:00:27,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {6550#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {6550#true} is VALID [2022-04-28 15:00:27,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {6550#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {6550#true} is VALID [2022-04-28 15:00:27,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {6550#true} assume !(0 != ~p1~0); {6550#true} is VALID [2022-04-28 15:00:27,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {6550#true} assume !(0 != ~p2~0); {6550#true} is VALID [2022-04-28 15:00:27,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {6550#true} assume !(0 != ~p3~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-28 15:00:27,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p3~0; {6551#false} is VALID [2022-04-28 15:00:27,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {6551#false} assume 1 != ~lk3~0; {6551#false} is VALID [2022-04-28 15:00:27,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {6551#false} assume !false; {6551#false} is VALID [2022-04-28 15:00:27,206 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-28 15:00:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:27,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094812650] [2022-04-28 15:00:27,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094812650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:27,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:27,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:27,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:27,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101189208] [2022-04-28 15:00:27,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101189208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:27,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:27,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:27,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739439766] [2022-04-28 15:00:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:27,207 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-28 15:00:27,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:27,207 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-28 15:00:27,223 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-28 15:00:27,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:27,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:27,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:27,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:27,224 INFO L87 Difference]: Start difference. First operand 247 states and 445 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-28 15:00:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:27,418 INFO L93 Difference]: Finished difference Result 591 states and 1075 transitions. [2022-04-28 15:00:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:27,419 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-28 15:00:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:27,419 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-28 15:00:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-28 15:00:27,420 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-28 15:00:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-28 15:00:27,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-28 15:00:27,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:27,572 INFO L225 Difference]: With dead ends: 591 [2022-04-28 15:00:27,572 INFO L226 Difference]: Without dead ends: 353 [2022-04-28 15:00:27,573 INFO L412 NwaCegarLoop]: 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-28 15:00:27,573 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:27,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-28 15:00:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-04-28 15:00:27,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:27,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:27,590 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:27,591 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:27,597 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-28 15:00:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-28 15:00:27,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:27,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:27,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-28 15:00:27,599 INFO L87 Difference]: Start difference. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-28 15:00:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:27,605 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-28 15:00:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-28 15:00:27,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:27,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:27,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:27,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 631 transitions. [2022-04-28 15:00:27,613 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 631 transitions. Word has length 27 [2022-04-28 15:00:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:27,614 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 631 transitions. [2022-04-28 15:00:27,614 INFO L496 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-28 15:00:27,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 351 states and 631 transitions. [2022-04-28 15:00:28,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 631 transitions. [2022-04-28 15:00:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 15:00:28,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:28,129 INFO L195 NwaCegarLoop]: 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-28 15:00:28,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:00:28,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 1 times [2022-04-28 15:00:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:28,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963069634] [2022-04-28 15:00:28,130 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 2 times [2022-04-28 15:00:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:28,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322888008] [2022-04-28 15:00:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:28,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9152#true} is VALID [2022-04-28 15:00:28,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-28 15:00:28,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-28 15:00:28,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:28,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9152#true} is VALID [2022-04-28 15:00:28,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-28 15:00:28,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-28 15:00:28,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {9152#true} call #t~ret19 := main(); {9152#true} is VALID [2022-04-28 15:00:28,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {9152#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {9152#true} is VALID [2022-04-28 15:00:28,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {9152#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {9152#true} is VALID [2022-04-28 15:00:28,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {9152#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {9152#true} is VALID [2022-04-28 15:00:28,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {9152#true} assume !(0 != ~p1~0); {9152#true} is VALID [2022-04-28 15:00:28,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {9152#true} assume !(0 != ~p2~0); {9152#true} is VALID [2022-04-28 15:00:28,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {9152#true} assume 0 != ~p3~0;~lk3~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:00:28,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9153#false} is VALID [2022-04-28 15:00:28,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {9153#false} assume 0 != ~p4~0; {9153#false} is VALID [2022-04-28 15:00:28,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {9153#false} assume 1 != ~lk4~0; {9153#false} is VALID [2022-04-28 15:00:28,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-28 15:00:28,184 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-28 15:00:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:28,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322888008] [2022-04-28 15:00:28,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322888008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:28,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:28,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:28,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:28,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963069634] [2022-04-28 15:00:28,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963069634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:28,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:28,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666120557] [2022-04-28 15:00:28,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:28,186 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-28 15:00:28,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:28,186 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-28 15:00:28,200 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-28 15:00:28,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:28,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:28,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:28,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:28,201 INFO L87 Difference]: Start difference. First operand 351 states and 631 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-28 15:00:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:28,430 INFO L93 Difference]: Finished difference Result 529 states and 949 transitions. [2022-04-28 15:00:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:28,430 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-28 15:00:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:28,430 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-28 15:00:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-28 15:00:28,432 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-28 15:00:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-28 15:00:28,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-28 15:00:28,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:28,627 INFO L225 Difference]: With dead ends: 529 [2022-04-28 15:00:28,627 INFO L226 Difference]: Without dead ends: 359 [2022-04-28 15:00:28,628 INFO L412 NwaCegarLoop]: 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-28 15:00:28,628 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:28,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 147 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-28 15:00:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-04-28 15:00:28,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:28,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:28,645 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:28,646 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:28,652 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-28 15:00:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-28 15:00:28,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:28,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:28,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-28 15:00:28,655 INFO L87 Difference]: Start difference. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-28 15:00:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:28,661 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-28 15:00:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-28 15:00:28,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:28,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:28,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:28,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 635 transitions. [2022-04-28 15:00:28,669 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 635 transitions. Word has length 28 [2022-04-28 15:00:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:28,684 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 635 transitions. [2022-04-28 15:00:28,684 INFO L496 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-28 15:00:28,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 635 transitions. [2022-04-28 15:00:29,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 635 edges. 635 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 635 transitions. [2022-04-28 15:00:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 15:00:29,282 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:29,282 INFO L195 NwaCegarLoop]: 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-28 15:00:29,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:00:29,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 1 times [2022-04-28 15:00:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:29,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412687731] [2022-04-28 15:00:29,283 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 2 times [2022-04-28 15:00:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:29,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236877971] [2022-04-28 15:00:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:29,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:29,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {11654#true} is VALID [2022-04-28 15:00:29,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-28 15:00:29,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-28 15:00:29,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {11654#true} call ULTIMATE.init(); {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:29,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {11654#true} call #t~ret19 := main(); {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {11654#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {11654#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {11654#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {11654#true} assume !(0 != ~p1~0); {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {11654#true} assume !(0 != ~p2~0); {11654#true} is VALID [2022-04-28 15:00:29,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {11654#true} assume !(0 != ~p3~0); {11654#true} is VALID [2022-04-28 15:00:29,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {11654#true} assume 0 != ~p4~0;~lk4~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p4~0; {11659#(= main_~lk4~0 1)} is VALID [2022-04-28 15:00:29,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {11659#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {11655#false} is VALID [2022-04-28 15:00:29,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {11655#false} assume !false; {11655#false} is VALID [2022-04-28 15:00:29,342 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-28 15:00:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:29,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236877971] [2022-04-28 15:00:29,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236877971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:29,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:29,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:29,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:29,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412687731] [2022-04-28 15:00:29,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412687731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:29,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:29,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:29,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943049928] [2022-04-28 15:00:29,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:29,343 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-28 15:00:29,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:29,343 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-28 15:00:29,357 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-28 15:00:29,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:29,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:29,358 INFO L87 Difference]: Start difference. First operand 357 states and 635 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-28 15:00:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:29,583 INFO L93 Difference]: Finished difference Result 669 states and 1205 transitions. [2022-04-28 15:00:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:29,583 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-28 15:00:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:29,584 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-28 15:00:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-28 15:00:29,585 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-28 15:00:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-28 15:00:29,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-28 15:00:29,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:29,710 INFO L225 Difference]: With dead ends: 669 [2022-04-28 15:00:29,711 INFO L226 Difference]: Without dead ends: 667 [2022-04-28 15:00:29,711 INFO L412 NwaCegarLoop]: 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-28 15:00:29,711 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:29,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 99 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:29,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-28 15:00:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 489. [2022-04-28 15:00:29,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:29,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:29,742 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:29,743 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:29,759 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-28 15:00:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-28 15:00:29,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:29,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:29,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 667 states. [2022-04-28 15:00:29,761 INFO L87 Difference]: Start difference. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 667 states. [2022-04-28 15:00:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:29,778 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-28 15:00:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-28 15:00:29,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:29,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:29,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:29,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 859 transitions. [2022-04-28 15:00:29,792 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 859 transitions. Word has length 28 [2022-04-28 15:00:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:29,793 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 859 transitions. [2022-04-28 15:00:29,793 INFO L496 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-28 15:00:29,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 489 states and 859 transitions. [2022-04-28 15:00:30,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 859 edges. 859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 859 transitions. [2022-04-28 15:00:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 15:00:30,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:30,576 INFO L195 NwaCegarLoop]: 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-28 15:00:30,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:00:30,576 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 1 times [2022-04-28 15:00:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:30,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221085139] [2022-04-28 15:00:30,577 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 2 times [2022-04-28 15:00:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:30,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886332633] [2022-04-28 15:00:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:30,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15316#true} is VALID [2022-04-28 15:00:30,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-28 15:00:30,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {15316#true} call ULTIMATE.init(); {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:30,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {15316#true} call #t~ret19 := main(); {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {15316#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {15316#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {15316#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {15316#true} assume !(0 != ~p1~0); {15316#true} is VALID [2022-04-28 15:00:30,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {15316#true} assume !(0 != ~p2~0); {15316#true} is VALID [2022-04-28 15:00:30,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {15316#true} assume !(0 != ~p3~0); {15316#true} is VALID [2022-04-28 15:00:30,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {15316#true} assume !(0 != ~p4~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p10~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p1~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p2~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p3~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-28 15:00:30,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p4~0; {15317#false} is VALID [2022-04-28 15:00:30,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {15317#false} assume 1 != ~lk4~0; {15317#false} is VALID [2022-04-28 15:00:30,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {15317#false} assume !false; {15317#false} is VALID [2022-04-28 15:00:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:00:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:30,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886332633] [2022-04-28 15:00:30,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886332633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:30,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:30,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:30,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:30,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221085139] [2022-04-28 15:00:30,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221085139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:30,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:30,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195444504] [2022-04-28 15:00:30,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:30,617 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-28 15:00:30,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:30,617 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-28 15:00:30,631 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-28 15:00:30,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:30,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:30,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:30,631 INFO L87 Difference]: Start difference. First operand 489 states and 859 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-28 15:00:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:30,892 INFO L93 Difference]: Finished difference Result 1165 states and 2061 transitions. [2022-04-28 15:00:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:30,893 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-28 15:00:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:30,893 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-28 15:00:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-28 15:00:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-28 15:00:30,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 255 transitions. [2022-04-28 15:00:31,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:31,066 INFO L225 Difference]: With dead ends: 1165 [2022-04-28 15:00:31,066 INFO L226 Difference]: Without dead ends: 691 [2022-04-28 15:00:31,067 INFO L412 NwaCegarLoop]: 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-28 15:00:31,068 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:31,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 133 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-28 15:00:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-04-28 15:00:31,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:31,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:31,103 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:31,104 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:31,122 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-28 15:00:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-28 15:00:31,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:31,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:31,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 691 states. [2022-04-28 15:00:31,124 INFO L87 Difference]: Start difference. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 691 states. [2022-04-28 15:00:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:31,151 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-28 15:00:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-28 15:00:31,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:31,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:31,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:31,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1207 transitions. [2022-04-28 15:00:31,176 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1207 transitions. Word has length 28 [2022-04-28 15:00:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:31,177 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1207 transitions. [2022-04-28 15:00:31,177 INFO L496 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-28 15:00:31,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 689 states and 1207 transitions. [2022-04-28 15:00:32,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1207 transitions. [2022-04-28 15:00:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 15:00:32,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:32,291 INFO L195 NwaCegarLoop]: 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-28 15:00:32,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:00:32,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:32,292 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 1 times [2022-04-28 15:00:32,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:32,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [600775532] [2022-04-28 15:00:32,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 2 times [2022-04-28 15:00:32,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:32,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5428908] [2022-04-28 15:00:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:32,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-28 15:00:32,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-28 15:00:32,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-28 15:00:32,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {20418#true} call ULTIMATE.init(); {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:32,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-28 15:00:32,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-28 15:00:32,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-28 15:00:32,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {20418#true} call #t~ret19 := main(); {20418#true} is VALID [2022-04-28 15:00:32,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {20418#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {20418#true} is VALID [2022-04-28 15:00:32,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {20418#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {20418#true} is VALID [2022-04-28 15:00:32,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {20418#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {20418#true} is VALID [2022-04-28 15:00:32,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {20418#true} assume !(0 != ~p1~0); {20418#true} is VALID [2022-04-28 15:00:32,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {20418#true} assume !(0 != ~p2~0); {20418#true} is VALID [2022-04-28 15:00:32,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {20418#true} assume !(0 != ~p3~0); {20418#true} is VALID [2022-04-28 15:00:32,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {20418#true} assume 0 != ~p4~0;~lk4~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:00:32,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {20419#false} is VALID [2022-04-28 15:00:32,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {20419#false} assume 0 != ~p5~0; {20419#false} is VALID [2022-04-28 15:00:32,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {20419#false} assume 1 != ~lk5~0; {20419#false} is VALID [2022-04-28 15:00:32,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {20419#false} assume !false; {20419#false} is VALID [2022-04-28 15:00:32,346 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-28 15:00:32,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5428908] [2022-04-28 15:00:32,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5428908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:32,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:32,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:32,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:32,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [600775532] [2022-04-28 15:00:32,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [600775532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:32,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:32,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:32,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522249063] [2022-04-28 15:00:32,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:32,348 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-28 15:00:32,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:32,348 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-28 15:00:32,362 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-28 15:00:32,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:32,363 INFO L87 Difference]: Start difference. First operand 689 states and 1207 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-28 15:00:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:32,596 INFO L93 Difference]: Finished difference Result 1033 states and 1805 transitions. [2022-04-28 15:00:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:32,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 15:00:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:32,596 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-28 15:00:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-28 15:00:32,598 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-28 15:00:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-28 15:00:32,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2022-04-28 15:00:32,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:32,750 INFO L225 Difference]: With dead ends: 1033 [2022-04-28 15:00:32,750 INFO L226 Difference]: Without dead ends: 699 [2022-04-28 15:00:32,751 INFO L412 NwaCegarLoop]: 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-28 15:00:32,752 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:32,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-28 15:00:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-28 15:00:32,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:32,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:32,797 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:32,798 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:32,814 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-28 15:00:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-28 15:00:32,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:32,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:32,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-28 15:00:32,816 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-28 15:00:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:32,832 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-28 15:00:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-28 15:00:32,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:32,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:32,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:32,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1207 transitions. [2022-04-28 15:00:32,854 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1207 transitions. Word has length 29 [2022-04-28 15:00:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:32,855 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1207 transitions. [2022-04-28 15:00:32,855 INFO L496 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-28 15:00:32,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 1207 transitions. [2022-04-28 15:00:34,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1207 transitions. [2022-04-28 15:00:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 15:00:34,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:34,019 INFO L195 NwaCegarLoop]: 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-28 15:00:34,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:00:34,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:34,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 1 times [2022-04-28 15:00:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:34,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193751280] [2022-04-28 15:00:34,020 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 2 times [2022-04-28 15:00:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:34,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976538007] [2022-04-28 15:00:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:34,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:34,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25288#true} is VALID [2022-04-28 15:00:34,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-28 15:00:34,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-28 15:00:34,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {25288#true} call ULTIMATE.init(); {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:34,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25288#true} is VALID [2022-04-28 15:00:34,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-28 15:00:34,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-28 15:00:34,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {25288#true} call #t~ret19 := main(); {25288#true} is VALID [2022-04-28 15:00:34,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {25288#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {25288#true} is VALID [2022-04-28 15:00:34,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {25288#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {25288#true} is VALID [2022-04-28 15:00:34,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {25288#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {25288#true} is VALID [2022-04-28 15:00:34,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {25288#true} assume !(0 != ~p1~0); {25288#true} is VALID [2022-04-28 15:00:34,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {25288#true} assume !(0 != ~p2~0); {25288#true} is VALID [2022-04-28 15:00:34,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {25288#true} assume !(0 != ~p3~0); {25288#true} is VALID [2022-04-28 15:00:34,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {25288#true} assume !(0 != ~p4~0); {25288#true} is VALID [2022-04-28 15:00:34,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {25288#true} assume 0 != ~p5~0;~lk5~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p5~0; {25293#(= main_~lk5~0 1)} is VALID [2022-04-28 15:00:34,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {25293#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {25289#false} is VALID [2022-04-28 15:00:34,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {25289#false} assume !false; {25289#false} is VALID [2022-04-28 15:00:34,089 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-28 15:00:34,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:34,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976538007] [2022-04-28 15:00:34,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976538007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:34,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:34,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:34,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:34,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193751280] [2022-04-28 15:00:34,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193751280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:34,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:34,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738097308] [2022-04-28 15:00:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:34,090 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-28 15:00:34,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:34,090 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-28 15:00:34,107 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-28 15:00:34,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:34,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:34,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:34,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:34,108 INFO L87 Difference]: Start difference. First operand 697 states and 1207 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-28 15:00:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:34,443 INFO L93 Difference]: Finished difference Result 1293 states and 2273 transitions. [2022-04-28 15:00:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:34,443 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-28 15:00:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:34,444 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-28 15:00:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 15:00:34,445 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-28 15:00:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 15:00:34,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 15:00:34,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:34,646 INFO L225 Difference]: With dead ends: 1293 [2022-04-28 15:00:34,646 INFO L226 Difference]: Without dead ends: 1291 [2022-04-28 15:00:34,646 INFO L412 NwaCegarLoop]: 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-28 15:00:34,647 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:34,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:00:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-04-28 15:00:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 969. [2022-04-28 15:00:34,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:34,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:34,698 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:34,699 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:34,745 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-28 15:00:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-28 15:00:34,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:34,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:34,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1291 states. [2022-04-28 15:00:34,749 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1291 states. [2022-04-28 15:00:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:34,795 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-28 15:00:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-28 15:00:34,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:34,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:34,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:34,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1647 transitions. [2022-04-28 15:00:34,839 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1647 transitions. Word has length 29 [2022-04-28 15:00:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:34,840 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1647 transitions. [2022-04-28 15:00:34,840 INFO L496 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-28 15:00:34,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1647 transitions. [2022-04-28 15:00:36,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1647 edges. 1647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1647 transitions. [2022-04-28 15:00:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 15:00:36,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:36,250 INFO L195 NwaCegarLoop]: 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-28 15:00:36,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:00:36,250 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:36,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 1 times [2022-04-28 15:00:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:36,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230256014] [2022-04-28 15:00:36,251 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 2 times [2022-04-28 15:00:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:36,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093648491] [2022-04-28 15:00:36,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:36,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:36,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {32406#true} is VALID [2022-04-28 15:00:36,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-28 15:00:36,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-28 15:00:36,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {32406#true} call ULTIMATE.init(); {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:36,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {32406#true} is VALID [2022-04-28 15:00:36,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-28 15:00:36,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-28 15:00:36,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {32406#true} call #t~ret19 := main(); {32406#true} is VALID [2022-04-28 15:00:36,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {32406#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {32406#true} is VALID [2022-04-28 15:00:36,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {32406#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {32406#true} is VALID [2022-04-28 15:00:36,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {32406#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {32406#true} is VALID [2022-04-28 15:00:36,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {32406#true} assume !(0 != ~p1~0); {32406#true} is VALID [2022-04-28 15:00:36,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {32406#true} assume !(0 != ~p2~0); {32406#true} is VALID [2022-04-28 15:00:36,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {32406#true} assume !(0 != ~p3~0); {32406#true} is VALID [2022-04-28 15:00:36,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {32406#true} assume !(0 != ~p4~0); {32406#true} is VALID [2022-04-28 15:00:36,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {32406#true} assume !(0 != ~p5~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p10~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p1~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p2~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p3~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p4~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-28 15:00:36,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p5~0; {32407#false} is VALID [2022-04-28 15:00:36,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {32407#false} assume 1 != ~lk5~0; {32407#false} is VALID [2022-04-28 15:00:36,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {32407#false} assume !false; {32407#false} is VALID [2022-04-28 15:00:36,310 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-28 15:00:36,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:36,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093648491] [2022-04-28 15:00:36,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093648491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:36,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:36,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:36,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:36,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230256014] [2022-04-28 15:00:36,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230256014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:36,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:36,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084617397] [2022-04-28 15:00:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:36,312 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-28 15:00:36,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:36,312 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-28 15:00:36,323 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-28 15:00:36,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:36,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:36,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:36,323 INFO L87 Difference]: Start difference. First operand 969 states and 1647 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-28 15:00:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:36,806 INFO L93 Difference]: Finished difference Result 2301 states and 3937 transitions. [2022-04-28 15:00:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:36,806 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-28 15:00:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:36,806 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-28 15:00:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-28 15:00:36,808 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-28 15:00:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-28 15:00:36,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 252 transitions. [2022-04-28 15:00:36,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:37,039 INFO L225 Difference]: With dead ends: 2301 [2022-04-28 15:00:37,039 INFO L226 Difference]: Without dead ends: 1355 [2022-04-28 15:00:37,041 INFO L412 NwaCegarLoop]: 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-28 15:00:37,041 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:37,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 135 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-28 15:00:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-28 15:00:37,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:37,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:37,130 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:37,131 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:37,181 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-28 15:00:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-28 15:00:37,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:37,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:37,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-28 15:00:37,186 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-28 15:00:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:37,236 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-28 15:00:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-28 15:00:37,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:37,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:37,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:37,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2295 transitions. [2022-04-28 15:00:37,323 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2295 transitions. Word has length 29 [2022-04-28 15:00:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:37,323 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 2295 transitions. [2022-04-28 15:00:37,323 INFO L496 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-28 15:00:37,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 2295 transitions. [2022-04-28 15:00:39,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2295 transitions. [2022-04-28 15:00:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:00:39,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:39,576 INFO L195 NwaCegarLoop]: 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-28 15:00:39,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:00:39,576 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 1 times [2022-04-28 15:00:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:39,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265399006] [2022-04-28 15:00:39,576 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 2 times [2022-04-28 15:00:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:39,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028860168] [2022-04-28 15:00:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:39,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:39,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {42436#true} is VALID [2022-04-28 15:00:39,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-28 15:00:39,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-28 15:00:39,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {42436#true} call ULTIMATE.init(); {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:39,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {42436#true} is VALID [2022-04-28 15:00:39,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-28 15:00:39,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {42436#true} call #t~ret19 := main(); {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {42436#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {42436#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {42436#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {42436#true} assume !(0 != ~p1~0); {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {42436#true} assume !(0 != ~p2~0); {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {42436#true} assume !(0 != ~p3~0); {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {42436#true} assume !(0 != ~p4~0); {42436#true} is VALID [2022-04-28 15:00:39,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {42436#true} assume 0 != ~p5~0;~lk5~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:00:39,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {42437#false} is VALID [2022-04-28 15:00:39,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {42437#false} assume 0 != ~p6~0; {42437#false} is VALID [2022-04-28 15:00:39,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {42437#false} assume 1 != ~lk6~0; {42437#false} is VALID [2022-04-28 15:00:39,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {42437#false} assume !false; {42437#false} is VALID [2022-04-28 15:00:39,639 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-28 15:00:39,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:39,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028860168] [2022-04-28 15:00:39,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028860168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:39,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:39,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:39,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:39,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265399006] [2022-04-28 15:00:39,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265399006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:39,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:39,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045845876] [2022-04-28 15:00:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:39,640 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-28 15:00:39,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:39,640 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-28 15:00:39,655 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-28 15:00:39,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:39,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:39,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:39,656 INFO L87 Difference]: Start difference. First operand 1353 states and 2295 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-28 15:00:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:40,103 INFO L93 Difference]: Finished difference Result 2029 states and 3433 transitions. [2022-04-28 15:00:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:40,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 15:00:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-28 15:00:40,108 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-28 15:00:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-28 15:00:40,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2022-04-28 15:00:40,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:40,433 INFO L225 Difference]: With dead ends: 2029 [2022-04-28 15:00:40,433 INFO L226 Difference]: Without dead ends: 1371 [2022-04-28 15:00:40,434 INFO L412 NwaCegarLoop]: 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-28 15:00:40,435 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:40,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 141 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-04-28 15:00:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2022-04-28 15:00:40,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:40,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:40,538 INFO L74 IsIncluded]: Start isIncluded. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:40,540 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:40,591 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-28 15:00:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-28 15:00:40,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:40,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:40,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1371 states. [2022-04-28 15:00:40,595 INFO L87 Difference]: Start difference. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1371 states. [2022-04-28 15:00:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:40,650 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-28 15:00:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-28 15:00:40,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:40,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:40,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:40,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2295 transitions. [2022-04-28 15:00:40,734 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2295 transitions. Word has length 30 [2022-04-28 15:00:40,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:40,734 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 2295 transitions. [2022-04-28 15:00:40,735 INFO L496 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-28 15:00:40,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1369 states and 2295 transitions. [2022-04-28 15:00:42,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2295 transitions. [2022-04-28 15:00:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:00:42,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:42,970 INFO L195 NwaCegarLoop]: 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-28 15:00:42,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:00:42,970 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 1 times [2022-04-28 15:00:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:42,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719441065] [2022-04-28 15:00:42,971 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 2 times [2022-04-28 15:00:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:42,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748028421] [2022-04-28 15:00:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:43,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:43,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {51986#true} is VALID [2022-04-28 15:00:43,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-28 15:00:43,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-28 15:00:43,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {51986#true} call ULTIMATE.init(); {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:43,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {51986#true} is VALID [2022-04-28 15:00:43,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-28 15:00:43,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-28 15:00:43,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {51986#true} call #t~ret19 := main(); {51986#true} is VALID [2022-04-28 15:00:43,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {51986#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {51986#true} is VALID [2022-04-28 15:00:43,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {51986#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {51986#true} is VALID [2022-04-28 15:00:43,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {51986#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {51986#true} is VALID [2022-04-28 15:00:43,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {51986#true} assume !(0 != ~p1~0); {51986#true} is VALID [2022-04-28 15:00:43,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {51986#true} assume !(0 != ~p2~0); {51986#true} is VALID [2022-04-28 15:00:43,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {51986#true} assume !(0 != ~p3~0); {51986#true} is VALID [2022-04-28 15:00:43,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {51986#true} assume !(0 != ~p4~0); {51986#true} is VALID [2022-04-28 15:00:43,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {51986#true} assume !(0 != ~p5~0); {51986#true} is VALID [2022-04-28 15:00:43,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {51986#true} assume 0 != ~p6~0;~lk6~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p6~0; {51991#(= main_~lk6~0 1)} is VALID [2022-04-28 15:00:43,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {51991#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {51987#false} is VALID [2022-04-28 15:00:43,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {51987#false} assume !false; {51987#false} is VALID [2022-04-28 15:00:43,040 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-28 15:00:43,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:43,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748028421] [2022-04-28 15:00:43,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748028421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:43,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:43,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:43,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:43,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719441065] [2022-04-28 15:00:43,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719441065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:43,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:43,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685355262] [2022-04-28 15:00:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:43,042 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-28 15:00:43,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:43,042 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-28 15:00:43,054 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-28 15:00:43,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:43,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:43,061 INFO L87 Difference]: Start difference. First operand 1369 states and 2295 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-28 15:00:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:43,695 INFO L93 Difference]: Finished difference Result 2509 states and 4281 transitions. [2022-04-28 15:00:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:43,695 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-28 15:00:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:43,695 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-28 15:00:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 15:00:43,697 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-28 15:00:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 15:00:43,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-28 15:00:43,790 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-28 15:00:44,023 INFO L225 Difference]: With dead ends: 2509 [2022-04-28 15:00:44,023 INFO L226 Difference]: Without dead ends: 2507 [2022-04-28 15:00:44,024 INFO L412 NwaCegarLoop]: 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-28 15:00:44,024 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:44,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 97 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:00:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-28 15:00:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1929. [2022-04-28 15:00:44,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:44,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:44,142 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:44,144 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:44,306 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-28 15:00:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-28 15:00:44,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:44,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:44,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states 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-28 15:00:44,312 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states 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-28 15:00:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:44,478 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-28 15:00:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-28 15:00:44,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:44,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:44,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:44,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3159 transitions. [2022-04-28 15:00:44,657 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3159 transitions. Word has length 30 [2022-04-28 15:00:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:44,658 INFO L495 AbstractCegarLoop]: Abstraction has 1929 states and 3159 transitions. [2022-04-28 15:00:44,658 INFO L496 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-28 15:00:44,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 3159 transitions. [2022-04-28 15:00:47,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3159 edges. 3159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3159 transitions. [2022-04-28 15:00:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:00:47,721 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:47,721 INFO L195 NwaCegarLoop]: 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-28 15:00:47,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:00:47,721 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:47,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 1 times [2022-04-28 15:00:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:47,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347789071] [2022-04-28 15:00:47,722 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 2 times [2022-04-28 15:00:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:47,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671903157] [2022-04-28 15:00:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:47,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {65888#true} is VALID [2022-04-28 15:00:47,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-28 15:00:47,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-28 15:00:47,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {65888#true} call ULTIMATE.init(); {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:47,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {65888#true} is VALID [2022-04-28 15:00:47,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-28 15:00:47,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {65888#true} call #t~ret19 := main(); {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {65888#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {65888#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {65888#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {65888#true} assume !(0 != ~p1~0); {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {65888#true} assume !(0 != ~p2~0); {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {65888#true} assume !(0 != ~p3~0); {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {65888#true} assume !(0 != ~p4~0); {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {65888#true} assume !(0 != ~p5~0); {65888#true} is VALID [2022-04-28 15:00:47,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {65888#true} assume !(0 != ~p6~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p10~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p1~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p2~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p3~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p4~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p5~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-28 15:00:47,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p6~0; {65889#false} is VALID [2022-04-28 15:00:47,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {65889#false} assume 1 != ~lk6~0; {65889#false} is VALID [2022-04-28 15:00:47,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {65889#false} assume !false; {65889#false} is VALID [2022-04-28 15:00:47,771 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-28 15:00:47,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:47,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671903157] [2022-04-28 15:00:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671903157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:47,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:47,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:47,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347789071] [2022-04-28 15:00:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347789071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:47,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:47,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:47,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382347591] [2022-04-28 15:00:47,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:47,773 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-28 15:00:47,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:47,773 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-28 15:00:47,786 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-28 15:00:47,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:47,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:47,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:47,789 INFO L87 Difference]: Start difference. First operand 1929 states and 3159 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-28 15:00:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:49,118 INFO L93 Difference]: Finished difference Result 4557 states and 7513 transitions. [2022-04-28 15:00:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:49,118 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-28 15:00:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-28 15:00:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-28 15:00:49,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 249 transitions. [2022-04-28 15:00:49,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:49,536 INFO L225 Difference]: With dead ends: 4557 [2022-04-28 15:00:49,536 INFO L226 Difference]: Without dead ends: 2667 [2022-04-28 15:00:49,539 INFO L412 NwaCegarLoop]: 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-28 15:00:49,540 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:49,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 137 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:00:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-04-28 15:00:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2665. [2022-04-28 15:00:49,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:49,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:49,730 INFO L74 IsIncluded]: Start isIncluded. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:49,731 INFO L87 Difference]: Start difference. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:49,933 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-28 15:00:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-28 15:00:49,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:49,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:49,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2667 states. [2022-04-28 15:00:49,939 INFO L87 Difference]: Start difference. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2667 states. [2022-04-28 15:00:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:50,160 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-28 15:00:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-28 15:00:50,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:50,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:50,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:50,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 4359 transitions. [2022-04-28 15:00:50,525 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 4359 transitions. Word has length 30 [2022-04-28 15:00:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:50,525 INFO L495 AbstractCegarLoop]: Abstraction has 2665 states and 4359 transitions. [2022-04-28 15:00:50,525 INFO L496 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-28 15:00:50,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2665 states and 4359 transitions. [2022-04-28 15:00:54,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 4359 transitions. [2022-04-28 15:00:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:00:54,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:54,661 INFO L195 NwaCegarLoop]: 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-28 15:00:54,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:00:54,661 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 1 times [2022-04-28 15:00:54,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:54,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [111613593] [2022-04-28 15:00:54,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 2 times [2022-04-28 15:00:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:54,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77499021] [2022-04-28 15:00:54,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:54,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {85678#true} is VALID [2022-04-28 15:00:54,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-28 15:00:54,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-28 15:00:54,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {85678#true} call ULTIMATE.init(); {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:54,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {85678#true} is VALID [2022-04-28 15:00:54,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-28 15:00:54,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-28 15:00:54,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {85678#true} call #t~ret19 := main(); {85678#true} is VALID [2022-04-28 15:00:54,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {85678#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {85678#true} is VALID [2022-04-28 15:00:54,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {85678#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {85678#true} is VALID [2022-04-28 15:00:54,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {85678#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {85678#true} is VALID [2022-04-28 15:00:54,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {85678#true} assume !(0 != ~p1~0); {85678#true} is VALID [2022-04-28 15:00:54,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {85678#true} assume !(0 != ~p2~0); {85678#true} is VALID [2022-04-28 15:00:54,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {85678#true} assume !(0 != ~p3~0); {85678#true} is VALID [2022-04-28 15:00:54,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {85678#true} assume !(0 != ~p4~0); {85678#true} is VALID [2022-04-28 15:00:54,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {85678#true} assume !(0 != ~p5~0); {85678#true} is VALID [2022-04-28 15:00:54,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {85678#true} assume 0 != ~p6~0;~lk6~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:00:54,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {85679#false} is VALID [2022-04-28 15:00:54,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {85679#false} assume 0 != ~p7~0; {85679#false} is VALID [2022-04-28 15:00:54,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {85679#false} assume 1 != ~lk7~0; {85679#false} is VALID [2022-04-28 15:00:54,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {85679#false} assume !false; {85679#false} is VALID [2022-04-28 15:00:54,746 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-28 15:00:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:54,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77499021] [2022-04-28 15:00:54,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77499021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:54,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:54,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:54,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:54,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [111613593] [2022-04-28 15:00:54,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [111613593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:54,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:54,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140929664] [2022-04-28 15:00:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:54,748 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-28 15:00:54,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:54,748 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-28 15:00:54,764 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-28 15:00:54,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:54,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:54,765 INFO L87 Difference]: Start difference. First operand 2665 states and 4359 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-28 15:00:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:55,804 INFO L93 Difference]: Finished difference Result 3997 states and 6521 transitions. [2022-04-28 15:00:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:55,804 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-28 15:00:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:55,804 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-28 15:00:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-28 15:00:55,806 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-28 15:00:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-28 15:00:55,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-28 15:00:55,963 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-28 15:00:56,234 INFO L225 Difference]: With dead ends: 3997 [2022-04-28 15:00:56,234 INFO L226 Difference]: Without dead ends: 2699 [2022-04-28 15:00:56,236 INFO L412 NwaCegarLoop]: 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-28 15:00:56,236 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 138 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:56,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 138 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:00:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-28 15:00:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2022-04-28 15:00:56,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:56,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:56,404 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:56,406 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:56,609 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-28 15:00:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-28 15:00:56,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:56,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:56,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-28 15:00:56,616 INFO L87 Difference]: Start difference. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-28 15:00:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:56,815 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-28 15:00:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-28 15:00:56,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:56,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:56,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:56,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4359 transitions. [2022-04-28 15:00:57,157 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4359 transitions. Word has length 31 [2022-04-28 15:00:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:57,158 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 4359 transitions. [2022-04-28 15:00:57,158 INFO L496 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-28 15:00:57,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2697 states and 4359 transitions. [2022-04-28 15:01:01,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4359 transitions. [2022-04-28 15:01:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:01:01,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:01,260 INFO L195 NwaCegarLoop]: 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-28 15:01:01,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:01:01,260 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 1 times [2022-04-28 15:01:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447374036] [2022-04-28 15:01:01,261 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 2 times [2022-04-28 15:01:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332259500] [2022-04-28 15:01:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:01,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {104476#true} is VALID [2022-04-28 15:01:01,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-28 15:01:01,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-28 15:01:01,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {104476#true} call ULTIMATE.init(); {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {104476#true} call #t~ret19 := main(); {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {104476#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {104476#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {104476#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {104476#true} assume !(0 != ~p1~0); {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {104476#true} assume !(0 != ~p2~0); {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {104476#true} assume !(0 != ~p3~0); {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {104476#true} assume !(0 != ~p4~0); {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {104476#true} assume !(0 != ~p5~0); {104476#true} is VALID [2022-04-28 15:01:01,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {104476#true} assume !(0 != ~p6~0); {104476#true} is VALID [2022-04-28 15:01:01,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {104476#true} assume 0 != ~p7~0;~lk7~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p7~0; {104481#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:01,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {104481#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {104477#false} is VALID [2022-04-28 15:01:01,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {104477#false} assume !false; {104477#false} is VALID [2022-04-28 15:01:01,332 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-28 15:01:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:01,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332259500] [2022-04-28 15:01:01,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332259500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:01,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:01,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:01,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:01,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447374036] [2022-04-28 15:01:01,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447374036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:01,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:01,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156647299] [2022-04-28 15:01:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:01,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-28 15:01:01,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:01,335 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-28 15:01:01,346 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-28 15:01:01,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:01,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:01,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:01,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:01,348 INFO L87 Difference]: Start difference. First operand 2697 states and 4359 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-28 15:01:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:02,940 INFO L93 Difference]: Finished difference Result 4877 states and 8041 transitions. [2022-04-28 15:01:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:02,940 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-28 15:01:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:02,941 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-28 15:01:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-28 15:01:02,944 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-28 15:01:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-28 15:01:02,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-28 15:01:03,037 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-28 15:01:03,942 INFO L225 Difference]: With dead ends: 4877 [2022-04-28 15:01:03,943 INFO L226 Difference]: Without dead ends: 4875 [2022-04-28 15:01:03,943 INFO L412 NwaCegarLoop]: 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-28 15:01:03,944 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:03,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 96 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-28 15:01:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 3849. [2022-04-28 15:01:04,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:04,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:04,243 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:04,246 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:04,964 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-28 15:01:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-28 15:01:04,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:04,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:04,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states 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-28 15:01:04,975 INFO L87 Difference]: Start difference. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states 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-28 15:01:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:05,684 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-28 15:01:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-28 15:01:05,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:05,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:05,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:05,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 6055 transitions. [2022-04-28 15:01:06,406 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 6055 transitions. Word has length 31 [2022-04-28 15:01:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:06,406 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 6055 transitions. [2022-04-28 15:01:06,406 INFO L496 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-28 15:01:06,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3849 states and 6055 transitions. [2022-04-28 15:01:12,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6055 edges. 6055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 6055 transitions. [2022-04-28 15:01:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:01:12,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:12,146 INFO L195 NwaCegarLoop]: 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-28 15:01:12,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:01:12,147 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 1 times [2022-04-28 15:01:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:12,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716473070] [2022-04-28 15:01:12,148 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 2 times [2022-04-28 15:01:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:12,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870745398] [2022-04-28 15:01:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:12,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:12,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {131690#true} is VALID [2022-04-28 15:01:12,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-28 15:01:12,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-28 15:01:12,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {131690#true} call ULTIMATE.init(); {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:12,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {131690#true} is VALID [2022-04-28 15:01:12,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-28 15:01:12,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-28 15:01:12,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {131690#true} call #t~ret19 := main(); {131690#true} is VALID [2022-04-28 15:01:12,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {131690#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {131690#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {131690#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {131690#true} assume !(0 != ~p1~0); {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {131690#true} assume !(0 != ~p2~0); {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {131690#true} assume !(0 != ~p3~0); {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {131690#true} assume !(0 != ~p4~0); {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {131690#true} assume !(0 != ~p5~0); {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {131690#true} assume !(0 != ~p6~0); {131690#true} is VALID [2022-04-28 15:01:12,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {131690#true} assume !(0 != ~p7~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p10~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p1~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p2~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p3~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p4~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p5~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p6~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:12,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p7~0; {131691#false} is VALID [2022-04-28 15:01:12,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {131691#false} assume 1 != ~lk7~0; {131691#false} is VALID [2022-04-28 15:01:12,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {131691#false} assume !false; {131691#false} is VALID [2022-04-28 15:01:12,210 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-28 15:01:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:12,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870745398] [2022-04-28 15:01:12,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870745398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:12,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:12,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:12,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:12,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716473070] [2022-04-28 15:01:12,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716473070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:12,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:12,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306692487] [2022-04-28 15:01:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:12,212 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-28 15:01:12,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:12,212 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-28 15:01:12,233 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-28 15:01:12,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:12,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:12,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:12,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:12,233 INFO L87 Difference]: Start difference. First operand 3849 states and 6055 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-28 15:01:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:16,462 INFO L93 Difference]: Finished difference Result 9037 states and 14313 transitions. [2022-04-28 15:01:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:16,462 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-28 15:01:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:16,462 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-28 15:01:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-28 15:01:16,464 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-28 15:01:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-28 15:01:16,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-28 15:01:16,620 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-28 15:01:17,659 INFO L225 Difference]: With dead ends: 9037 [2022-04-28 15:01:17,659 INFO L226 Difference]: Without dead ends: 5259 [2022-04-28 15:01:17,664 INFO L412 NwaCegarLoop]: 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-28 15:01:17,665 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 139 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:17,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 139 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-28 15:01:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5257. [2022-04-28 15:01:18,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:18,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,046 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,050 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,855 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-28 15:01:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-28 15:01:18,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:18,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:18,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-28 15:01:18,869 INFO L87 Difference]: Start difference. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-28 15:01:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:19,696 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-28 15:01:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-28 15:01:19,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:19,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:19,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:19,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8263 transitions. [2022-04-28 15:01:21,005 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8263 transitions. Word has length 31 [2022-04-28 15:01:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:21,006 INFO L495 AbstractCegarLoop]: Abstraction has 5257 states and 8263 transitions. [2022-04-28 15:01:21,006 INFO L496 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-28 15:01:21,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5257 states and 8263 transitions. [2022-04-28 15:01:28,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8263 transitions. [2022-04-28 15:01:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 15:01:28,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:28,881 INFO L195 NwaCegarLoop]: 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-28 15:01:28,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:01:28,881 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:28,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 1 times [2022-04-28 15:01:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:28,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [887580756] [2022-04-28 15:01:28,882 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:28,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 2 times [2022-04-28 15:01:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:28,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133309776] [2022-04-28 15:01:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:28,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:28,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {170808#true} is VALID [2022-04-28 15:01:28,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-28 15:01:28,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-28 15:01:28,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {170808#true} call ULTIMATE.init(); {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:28,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {170808#true} is VALID [2022-04-28 15:01:28,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-28 15:01:28,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-28 15:01:28,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {170808#true} call #t~ret19 := main(); {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {170808#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {170808#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {170808#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {170808#true} assume !(0 != ~p1~0); {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {170808#true} assume !(0 != ~p2~0); {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {170808#true} assume !(0 != ~p3~0); {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {170808#true} assume !(0 != ~p4~0); {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {170808#true} assume !(0 != ~p5~0); {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {170808#true} assume !(0 != ~p6~0); {170808#true} is VALID [2022-04-28 15:01:28,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {170808#true} assume 0 != ~p7~0;~lk7~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:01:28,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {170809#false} is VALID [2022-04-28 15:01:28,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {170809#false} assume 0 != ~p8~0; {170809#false} is VALID [2022-04-28 15:01:28,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {170809#false} assume 1 != ~lk8~0; {170809#false} is VALID [2022-04-28 15:01:28,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {170809#false} assume !false; {170809#false} is VALID [2022-04-28 15:01:28,934 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-28 15:01:28,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:28,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133309776] [2022-04-28 15:01:28,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133309776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:28,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:28,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:28,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:28,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [887580756] [2022-04-28 15:01:28,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [887580756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:28,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:28,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:28,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677322489] [2022-04-28 15:01:28,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:28,935 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-28 15:01:28,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:28,936 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-28 15:01:28,948 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-28 15:01:28,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:28,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:28,949 INFO L87 Difference]: Start difference. First operand 5257 states and 8263 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-28 15:01:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:32,366 INFO L93 Difference]: Finished difference Result 7885 states and 12361 transitions. [2022-04-28 15:01:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:32,366 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-28 15:01:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:32,368 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-28 15:01:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-28 15:01:32,370 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-28 15:01:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-28 15:01:32,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-28 15:01:32,514 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-28 15:01:33,598 INFO L225 Difference]: With dead ends: 7885 [2022-04-28 15:01:33,598 INFO L226 Difference]: Without dead ends: 5323 [2022-04-28 15:01:33,602 INFO L412 NwaCegarLoop]: 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-28 15:01:33,603 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:33,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2022-04-28 15:01:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5321. [2022-04-28 15:01:34,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:34,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,168 INFO L74 IsIncluded]: Start isIncluded. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,172 INFO L87 Difference]: Start difference. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,974 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-28 15:01:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-28 15:01:34,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:34,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:34,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5323 states. [2022-04-28 15:01:34,988 INFO L87 Difference]: Start difference. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5323 states. [2022-04-28 15:01:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:35,788 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-28 15:01:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-28 15:01:35,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:35,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:35,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:35,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 8263 transitions. [2022-04-28 15:01:37,181 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 8263 transitions. Word has length 32 [2022-04-28 15:01:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:37,181 INFO L495 AbstractCegarLoop]: Abstraction has 5321 states and 8263 transitions. [2022-04-28 15:01:37,181 INFO L496 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-28 15:01:37,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5321 states and 8263 transitions. [2022-04-28 15:01:45,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 8263 transitions. [2022-04-28 15:01:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 15:01:45,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:45,812 INFO L195 NwaCegarLoop]: 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-28 15:01:45,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:01:45,813 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 1 times [2022-04-28 15:01:45,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:45,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089748664] [2022-04-28 15:01:45,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 2 times [2022-04-28 15:01:45,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:45,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130678809] [2022-04-28 15:01:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:45,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {207878#true} is VALID [2022-04-28 15:01:45,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-28 15:01:45,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-28 15:01:45,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {207878#true} call ULTIMATE.init(); {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:45,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {207878#true} is VALID [2022-04-28 15:01:45,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-28 15:01:45,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {207878#true} call #t~ret19 := main(); {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {207878#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {207878#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {207878#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {207878#true} assume !(0 != ~p1~0); {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {207878#true} assume !(0 != ~p2~0); {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {207878#true} assume !(0 != ~p3~0); {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {207878#true} assume !(0 != ~p4~0); {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {207878#true} assume !(0 != ~p5~0); {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {207878#true} assume !(0 != ~p6~0); {207878#true} is VALID [2022-04-28 15:01:45,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {207878#true} assume !(0 != ~p7~0); {207878#true} is VALID [2022-04-28 15:01:45,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {207878#true} assume 0 != ~p8~0;~lk8~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p8~0; {207883#(= main_~lk8~0 1)} is VALID [2022-04-28 15:01:45,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {207883#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {207879#false} is VALID [2022-04-28 15:01:45,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {207879#false} assume !false; {207879#false} is VALID [2022-04-28 15:01:45,865 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-28 15:01:45,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:45,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130678809] [2022-04-28 15:01:45,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130678809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:45,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:45,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:45,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:45,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089748664] [2022-04-28 15:01:45,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089748664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:45,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:45,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:45,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823921574] [2022-04-28 15:01:45,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:45,866 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-28 15:01:45,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:45,867 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-28 15:01:45,901 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-28 15:01:45,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:45,902 INFO L87 Difference]: Start difference. First operand 5321 states and 8263 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-28 15:01:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:50,734 INFO L93 Difference]: Finished difference Result 9485 states and 15049 transitions. [2022-04-28 15:01:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:50,734 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-28 15:01:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:50,734 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-28 15:01:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 15:01:50,735 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-28 15:01:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 15:01:50,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 15:01:50,822 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-28 15:01:54,321 INFO L225 Difference]: With dead ends: 9485 [2022-04-28 15:01:54,322 INFO L226 Difference]: Without dead ends: 9483 [2022-04-28 15:01:54,323 INFO L412 NwaCegarLoop]: 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-28 15:01:54,323 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:54,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 95 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9483 states. [2022-04-28 15:01:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9483 to 7689. [2022-04-28 15:01:54,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:54,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,947 INFO L74 IsIncluded]: Start isIncluded. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,955 INFO L87 Difference]: Start difference. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:57,561 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-28 15:01:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-28 15:01:57,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:57,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:57,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9483 states. [2022-04-28 15:01:57,584 INFO L87 Difference]: Start difference. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9483 states. [2022-04-28 15:02:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:00,148 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-28 15:02:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-28 15:02:00,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:00,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:00,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:00,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 11591 transitions. [2022-04-28 15:02:02,899 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 11591 transitions. Word has length 32 [2022-04-28 15:02:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:02,899 INFO L495 AbstractCegarLoop]: Abstraction has 7689 states and 11591 transitions. [2022-04-28 15:02:02,899 INFO L496 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-28 15:02:02,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7689 states and 11591 transitions. [2022-04-28 15:02:14,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11591 edges. 11591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 11591 transitions. [2022-04-28 15:02:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 15:02:14,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:14,107 INFO L195 NwaCegarLoop]: 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-28 15:02:14,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:02:14,108 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 1 times [2022-04-28 15:02:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:14,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710805248] [2022-04-28 15:02:14,109 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 2 times [2022-04-28 15:02:14,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:14,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438841729] [2022-04-28 15:02:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:14,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:14,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {261204#true} is VALID [2022-04-28 15:02:14,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-28 15:02:14,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {261204#true} call ULTIMATE.init(); {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:14,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {261204#true} call #t~ret19 := main(); {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {261204#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {261204#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {261204#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {261204#true} assume !(0 != ~p1~0); {261204#true} is VALID [2022-04-28 15:02:14,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {261204#true} assume !(0 != ~p2~0); {261204#true} is VALID [2022-04-28 15:02:14,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {261204#true} assume !(0 != ~p3~0); {261204#true} is VALID [2022-04-28 15:02:14,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {261204#true} assume !(0 != ~p4~0); {261204#true} is VALID [2022-04-28 15:02:14,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {261204#true} assume !(0 != ~p5~0); {261204#true} is VALID [2022-04-28 15:02:14,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {261204#true} assume !(0 != ~p6~0); {261204#true} is VALID [2022-04-28 15:02:14,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {261204#true} assume !(0 != ~p7~0); {261204#true} is VALID [2022-04-28 15:02:14,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {261204#true} assume !(0 != ~p8~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p10~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p1~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p2~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p3~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p4~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p5~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p6~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p7~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:14,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p8~0; {261205#false} is VALID [2022-04-28 15:02:14,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {261205#false} assume 1 != ~lk8~0; {261205#false} is VALID [2022-04-28 15:02:14,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {261205#false} assume !false; {261205#false} is VALID [2022-04-28 15:02:14,164 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-28 15:02:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:14,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438841729] [2022-04-28 15:02:14,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438841729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:14,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:14,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:14,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:14,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710805248] [2022-04-28 15:02:14,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710805248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:14,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:14,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702586577] [2022-04-28 15:02:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:14,166 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-28 15:02:14,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:14,166 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-28 15:02:14,181 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-28 15:02:14,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:14,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:14,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:14,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:14,181 INFO L87 Difference]: Start difference. First operand 7689 states and 11591 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-28 15:02:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:29,773 INFO L93 Difference]: Finished difference Result 17933 states and 27209 transitions. [2022-04-28 15:02:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:29,774 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-28 15:02:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:29,774 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-28 15:02:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-28 15:02:29,776 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-28 15:02:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-28 15:02:29,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2022-04-28 15:02:29,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:33,997 INFO L225 Difference]: With dead ends: 17933 [2022-04-28 15:02:33,998 INFO L226 Difference]: Without dead ends: 10379 [2022-04-28 15:02:34,005 INFO L412 NwaCegarLoop]: 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-28 15:02:34,006 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:34,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 141 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2022-04-28 15:02:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10377. [2022-04-28 15:02:34,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:34,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:34,768 INFO L74 IsIncluded]: Start isIncluded. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:34,777 INFO L87 Difference]: Start difference. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:37,753 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-28 15:02:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-28 15:02:37,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:37,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:37,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10379 states. [2022-04-28 15:02:37,781 INFO L87 Difference]: Start difference. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10379 states. [2022-04-28 15:02:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:40,908 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-28 15:02:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-28 15:02:40,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:40,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:40,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:40,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 15623 transitions. [2022-04-28 15:02:45,753 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 15623 transitions. Word has length 32 [2022-04-28 15:02:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:45,753 INFO L495 AbstractCegarLoop]: Abstraction has 10377 states and 15623 transitions. [2022-04-28 15:02:45,753 INFO L496 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-28 15:02:45,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10377 states and 15623 transitions. [2022-04-28 15:03:01,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 15623 transitions. [2022-04-28 15:03:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 15:03:01,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:03:01,580 INFO L195 NwaCegarLoop]: 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-28 15:03:01,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:03:01,580 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:03:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:03:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 1 times [2022-04-28 15:03:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:01,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209848767] [2022-04-28 15:03:01,581 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:03:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 2 times [2022-04-28 15:03:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:03:01,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409785875] [2022-04-28 15:03:01,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:03:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:03:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:03:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:01,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {338594#true} is VALID [2022-04-28 15:03:01,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-28 15:03:01,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-28 15:03:01,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {338594#true} call ULTIMATE.init(); {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {338594#true} call #t~ret19 := main(); {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {338594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {338594#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {338594#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {338594#true} assume !(0 != ~p1~0); {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {338594#true} assume !(0 != ~p2~0); {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {338594#true} assume !(0 != ~p3~0); {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {338594#true} assume !(0 != ~p4~0); {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {338594#true} assume !(0 != ~p5~0); {338594#true} is VALID [2022-04-28 15:03:01,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {338594#true} assume !(0 != ~p6~0); {338594#true} is VALID [2022-04-28 15:03:01,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {338594#true} assume !(0 != ~p7~0); {338594#true} is VALID [2022-04-28 15:03:01,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {338594#true} assume 0 != ~p8~0;~lk8~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-28 15:03:01,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {338595#false} is VALID [2022-04-28 15:03:01,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {338595#false} assume 0 != ~p9~0; {338595#false} is VALID [2022-04-28 15:03:01,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {338595#false} assume 1 != ~lk9~0; {338595#false} is VALID [2022-04-28 15:03:01,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {338595#false} assume !false; {338595#false} is VALID [2022-04-28 15:03:01,648 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-28 15:03:01,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:03:01,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409785875] [2022-04-28 15:03:01,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409785875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:01,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:01,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:03:01,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:03:01,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209848767] [2022-04-28 15:03:01,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209848767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:01,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:01,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:03:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863153364] [2022-04-28 15:03:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:03:01,649 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-28 15:03:01,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:03:01,649 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-28 15:03:01,659 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-28 15:03:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:03:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:03:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:03:01,660 INFO L87 Difference]: Start difference. First operand 10377 states and 15623 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-28 15:03:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:13,776 INFO L93 Difference]: Finished difference Result 15565 states and 23369 transitions. [2022-04-28 15:03:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:03:13,777 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-28 15:03:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:03:13,777 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-28 15:03:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-28 15:03:13,778 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-28 15:03:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-28 15:03:13,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 238 transitions. [2022-04-28 15:03:13,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:18,004 INFO L225 Difference]: With dead ends: 15565 [2022-04-28 15:03:18,004 INFO L226 Difference]: Without dead ends: 10507 [2022-04-28 15:03:18,010 INFO L412 NwaCegarLoop]: 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-28 15:03:18,013 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 176 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 132 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-28 15:03:18,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:03:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2022-04-28 15:03:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 10505. [2022-04-28 15:03:18,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:03:18,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:18,873 INFO L74 IsIncluded]: Start isIncluded. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:18,882 INFO L87 Difference]: Start difference. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:22,096 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-28 15:03:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-28 15:03:22,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:22,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:22,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10507 states. [2022-04-28 15:03:22,124 INFO L87 Difference]: Start difference. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10507 states. [2022-04-28 15:03:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:25,405 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-28 15:03:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-28 15:03:25,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:25,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:25,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:03:25,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:03:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:03:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 15623 transitions. [2022-04-28 15:03:30,380 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 15623 transitions. Word has length 33 [2022-04-28 15:03:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:03:30,381 INFO L495 AbstractCegarLoop]: Abstraction has 10505 states and 15623 transitions. [2022-04-28 15:03:30,381 INFO L496 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-28 15:03:30,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10505 states and 15623 transitions. [2022-04-28 15:03:46,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 15623 transitions. [2022-04-28 15:03:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 15:03:46,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:03:46,758 INFO L195 NwaCegarLoop]: 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-28 15:03:46,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:03:46,758 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:03:46,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:03:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 1 times [2022-04-28 15:03:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:46,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254997876] [2022-04-28 15:03:46,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:03:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 2 times [2022-04-28 15:03:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:03:46,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994296451] [2022-04-28 15:03:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:03:46,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:03:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:46,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:03:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:46,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {411760#true} is VALID [2022-04-28 15:03:46,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-28 15:03:46,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {411760#true} call ULTIMATE.init(); {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:03:46,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {411760#true} call #t~ret19 := main(); {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {411760#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {411760#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {411760#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {411760#true} assume !(0 != ~p1~0); {411760#true} is VALID [2022-04-28 15:03:46,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {411760#true} assume !(0 != ~p2~0); {411760#true} is VALID [2022-04-28 15:03:46,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {411760#true} assume !(0 != ~p3~0); {411760#true} is VALID [2022-04-28 15:03:46,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {411760#true} assume !(0 != ~p4~0); {411760#true} is VALID [2022-04-28 15:03:46,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {411760#true} assume !(0 != ~p5~0); {411760#true} is VALID [2022-04-28 15:03:46,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {411760#true} assume !(0 != ~p6~0); {411760#true} is VALID [2022-04-28 15:03:46,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {411760#true} assume !(0 != ~p7~0); {411760#true} is VALID [2022-04-28 15:03:46,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {411760#true} assume !(0 != ~p8~0); {411760#true} is VALID [2022-04-28 15:03:46,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {411760#true} assume 0 != ~p9~0;~lk9~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p9~0; {411765#(= main_~lk9~0 1)} is VALID [2022-04-28 15:03:46,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {411765#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {411761#false} is VALID [2022-04-28 15:03:46,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {411761#false} assume !false; {411761#false} is VALID [2022-04-28 15:03:46,808 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-28 15:03:46,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:03:46,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994296451] [2022-04-28 15:03:46,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994296451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:46,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:46,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:03:46,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:03:46,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254997876] [2022-04-28 15:03:46,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254997876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:46,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:46,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:03:46,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755225806] [2022-04-28 15:03:46,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:03:46,809 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-28 15:03:46,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:03:46,810 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-28 15:03:46,829 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-28 15:03:46,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:03:46,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:46,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:03:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:03:46,829 INFO L87 Difference]: Start difference. First operand 10505 states and 15623 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-28 15:04:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:03,996 INFO L93 Difference]: Finished difference Result 18445 states and 28041 transitions. [2022-04-28 15:04:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:04:03,997 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-28 15:04:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:04:03,997 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-28 15:04:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 15:04:03,998 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-28 15:04:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 15:04:03,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-28 15:04:04,075 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-28 15:04:17,576 INFO L225 Difference]: With dead ends: 18445 [2022-04-28 15:04:17,576 INFO L226 Difference]: Without dead ends: 18443 [2022-04-28 15:04:17,579 INFO L412 NwaCegarLoop]: 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-28 15:04:17,580 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:04:17,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:04:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2022-04-28 15:04:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 15369. [2022-04-28 15:04:18,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:04:18,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:04:18,771 INFO L74 IsIncluded]: Start isIncluded. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:04:18,790 INFO L87 Difference]: Start difference. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:04:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:28,258 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-28 15:04:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-28 15:04:28,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:04:28,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:04:28,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18443 states. [2022-04-28 15:04:28,305 INFO L87 Difference]: Start difference. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18443 states. [2022-04-28 15:04:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:37,906 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-28 15:04:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-28 15:04:37,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:04:37,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:04:37,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:04:37,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:04:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:04:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 22151 transitions. [2022-04-28 15:04:49,197 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 22151 transitions. Word has length 33 [2022-04-28 15:04:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:04:49,198 INFO L495 AbstractCegarLoop]: Abstraction has 15369 states and 22151 transitions. [2022-04-28 15:04:49,198 INFO L496 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-28 15:04:49,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15369 states and 22151 transitions. [2022-04-28 15:05:10,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22151 edges. 22151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:05:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 22151 transitions. [2022-04-28 15:05:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 15:05:10,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:05:10,448 INFO L195 NwaCegarLoop]: 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-28 15:05:10,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:05:10,448 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:05:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:05:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 1 times [2022-04-28 15:05:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:05:10,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [313252435] [2022-04-28 15:05:10,449 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:05:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 2 times [2022-04-28 15:05:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:05:10,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76167139] [2022-04-28 15:05:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:05:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:05:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:05:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:05:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:05:10,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {516286#true} is VALID [2022-04-28 15:05:10,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-28 15:05:10,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {516286#true} call ULTIMATE.init(); {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:05:10,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {516286#true} call #t~ret19 := main(); {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {516286#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {516286#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {516286#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {516286#true} assume !(0 != ~p1~0); {516286#true} is VALID [2022-04-28 15:05:10,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {516286#true} assume !(0 != ~p2~0); {516286#true} is VALID [2022-04-28 15:05:10,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {516286#true} assume !(0 != ~p3~0); {516286#true} is VALID [2022-04-28 15:05:10,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {516286#true} assume !(0 != ~p4~0); {516286#true} is VALID [2022-04-28 15:05:10,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {516286#true} assume !(0 != ~p5~0); {516286#true} is VALID [2022-04-28 15:05:10,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {516286#true} assume !(0 != ~p6~0); {516286#true} is VALID [2022-04-28 15:05:10,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {516286#true} assume !(0 != ~p7~0); {516286#true} is VALID [2022-04-28 15:05:10,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {516286#true} assume !(0 != ~p8~0); {516286#true} is VALID [2022-04-28 15:05:10,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {516286#true} assume !(0 != ~p9~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p10~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p1~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p2~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p3~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p4~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p5~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p6~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p7~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p8~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-28 15:05:10,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p9~0; {516287#false} is VALID [2022-04-28 15:05:10,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {516287#false} assume 1 != ~lk9~0; {516287#false} is VALID [2022-04-28 15:05:10,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {516287#false} assume !false; {516287#false} is VALID [2022-04-28 15:05:10,518 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-28 15:05:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:05:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76167139] [2022-04-28 15:05:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76167139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:05:10,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:05:10,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:05:10,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:05:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [313252435] [2022-04-28 15:05:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [313252435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:05:10,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:05:10,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:05:10,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898241137] [2022-04-28 15:05:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:05:10,519 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-28 15:05:10,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:05:10,519 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-28 15:05:10,540 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-28 15:05:10,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:05:10,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:05:10,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:05:10,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:05:10,541 INFO L87 Difference]: Start difference. First operand 15369 states and 22151 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-28 15:06:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:42,867 INFO L93 Difference]: Finished difference Result 35597 states and 51593 transitions. [2022-04-28 15:06:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:06:42,867 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-28 15:06:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:06:42,867 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-28 15:06:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-28 15:06:42,868 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-28 15:06:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-28 15:06:42,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-28 15:06:43,016 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-28 15:06:59,302 INFO L225 Difference]: With dead ends: 35597 [2022-04-28 15:06:59,302 INFO L226 Difference]: Without dead ends: 20491 [2022-04-28 15:06:59,318 INFO L412 NwaCegarLoop]: 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-28 15:06:59,319 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 143 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:06:59,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:06:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2022-04-28 15:07:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 20489. [2022-04-28 15:07:00,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:07:00,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:07:00,981 INFO L74 IsIncluded]: Start isIncluded. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:07:01,009 INFO L87 Difference]: Start difference. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:07:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:07:13,269 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-28 15:07:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-28 15:07:13,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:07:13,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:07:13,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20491 states. [2022-04-28 15:07:13,335 INFO L87 Difference]: Start difference. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20491 states. [2022-04-28 15:07:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:07:25,040 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-28 15:07:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-28 15:07:25,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:07:25,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:07:25,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:07:25,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:07:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:07:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 29447 transitions. [2022-04-28 15:07:44,292 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 29447 transitions. Word has length 33 [2022-04-28 15:07:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:07:44,292 INFO L495 AbstractCegarLoop]: Abstraction has 20489 states and 29447 transitions. [2022-04-28 15:07:44,292 INFO L496 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-28 15:07:44,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20489 states and 29447 transitions. [2022-04-28 15:08:15,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:08:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 29447 transitions. [2022-04-28 15:08:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 15:08:15,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:08:15,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:08:15,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:08:15,619 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:08:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:08:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 1 times [2022-04-28 15:08:15,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:08:15,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [681449120] [2022-04-28 15:08:15,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:08:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 2 times [2022-04-28 15:08:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:08:15,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281035299] [2022-04-28 15:08:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:08:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:08:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:08:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:08:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:08:15,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {669452#true} is VALID [2022-04-28 15:08:15,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-28 15:08:15,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-28 15:08:15,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {669452#true} call ULTIMATE.init(); {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:08:15,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {669452#true} is VALID [2022-04-28 15:08:15,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-28 15:08:15,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-28 15:08:15,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {669452#true} call #t~ret19 := main(); {669452#true} is VALID [2022-04-28 15:08:15,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {669452#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {669452#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {669452#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {669452#true} assume !(0 != ~p1~0); {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {669452#true} assume !(0 != ~p2~0); {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {669452#true} assume !(0 != ~p3~0); {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {669452#true} assume !(0 != ~p4~0); {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {669452#true} assume !(0 != ~p5~0); {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {669452#true} assume !(0 != ~p6~0); {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {669452#true} assume !(0 != ~p7~0); {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {669452#true} assume !(0 != ~p8~0); {669452#true} is VALID [2022-04-28 15:08:15,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {669452#true} assume 0 != ~p9~0;~lk9~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:08:15,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {669453#false} is VALID [2022-04-28 15:08:15,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {669453#false} assume 0 != ~p10~0; {669453#false} is VALID [2022-04-28 15:08:15,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {669453#false} assume 1 != ~lk10~0; {669453#false} is VALID [2022-04-28 15:08:15,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {669453#false} assume !false; {669453#false} is VALID [2022-04-28 15:08:15,710 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-28 15:08:15,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:08:15,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281035299] [2022-04-28 15:08:15,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281035299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:08:15,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:08:15,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:08:15,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:08:15,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [681449120] [2022-04-28 15:08:15,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [681449120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:08:15,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:08:15,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:08:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838704921] [2022-04-28 15:08:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:08:15,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 15:08:15,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:08:15,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:08:15,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:08:15,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:08:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:08:15,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:08:15,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:08:15,729 INFO L87 Difference]: Start difference. First operand 20489 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:09:17,692 INFO L93 Difference]: Finished difference Result 30733 states and 44041 transitions. [2022-04-28 15:09:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:09:17,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 15:09:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:09:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-28 15:09:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-28 15:09:17,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-28 15:09:17,813 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-28 15:09:34,814 INFO L225 Difference]: With dead ends: 30733 [2022-04-28 15:09:34,814 INFO L226 Difference]: Without dead ends: 20747 [2022-04-28 15:09:34,827 INFO L412 NwaCegarLoop]: 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-28 15:09:34,828 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 129 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:09:34,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 129 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:09:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20747 states. [2022-04-28 15:09:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20747 to 20745. [2022-04-28 15:09:36,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:09:36,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:36,626 INFO L74 IsIncluded]: Start isIncluded. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:36,654 INFO L87 Difference]: Start difference. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:09:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:09:48,726 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-28 15:09:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-28 15:09:48,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:09:48,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:09:48,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20747 states. [2022-04-28 15:09:48,790 INFO L87 Difference]: Start difference. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20747 states. [2022-04-28 15:10:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:10:00,844 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-28 15:10:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-28 15:10:00,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:10:00,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:10:00,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:10:00,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:10:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:10:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20745 states to 20745 states and 29447 transitions. [2022-04-28 15:10:22,694 INFO L78 Accepts]: Start accepts. Automaton has 20745 states and 29447 transitions. Word has length 34 [2022-04-28 15:10:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:10:22,694 INFO L495 AbstractCegarLoop]: Abstraction has 20745 states and 29447 transitions. [2022-04-28 15:10:22,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:10:22,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20745 states and 29447 transitions. [2022-04-28 15:10:56,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:10:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20745 states and 29447 transitions. [2022-04-28 15:10:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 15:10:56,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:10:56,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:10:56,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:10:56,480 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:10:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:10:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 1 times [2022-04-28 15:10:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:10:56,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [612356319] [2022-04-28 15:10:56,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:10:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 2 times [2022-04-28 15:10:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:10:56,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977983300] [2022-04-28 15:10:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:10:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:10:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:10:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:10:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:10:56,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {813914#true} is VALID [2022-04-28 15:10:56,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-28 15:10:56,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-28 15:10:56,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {813914#true} call ULTIMATE.init(); {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:10:56,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {813914#true} is VALID [2022-04-28 15:10:56,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {813914#true} call #t~ret19 := main(); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {813914#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {813914#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {813914#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {813914#true} assume !(0 != ~p1~0); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {813914#true} assume !(0 != ~p2~0); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {813914#true} assume !(0 != ~p3~0); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {813914#true} assume !(0 != ~p4~0); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {813914#true} assume !(0 != ~p5~0); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {813914#true} assume !(0 != ~p6~0); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {813914#true} assume !(0 != ~p7~0); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {813914#true} assume !(0 != ~p8~0); {813914#true} is VALID [2022-04-28 15:10:56,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {813914#true} assume !(0 != ~p9~0); {813914#true} is VALID [2022-04-28 15:10:56,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {813914#true} assume !(0 != ~p10~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p1~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p2~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p3~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p4~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p5~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p6~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p7~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p8~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p9~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-28 15:10:56,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p10~0; {813915#false} is VALID [2022-04-28 15:10:56,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {813915#false} assume 1 != ~lk10~0; {813915#false} is VALID [2022-04-28 15:10:56,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {813915#false} assume !false; {813915#false} is VALID [2022-04-28 15:10:56,544 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-28 15:10:56,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:10:56,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977983300] [2022-04-28 15:10:56,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977983300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:10:56,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:10:56,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:10:56,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:10:56,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [612356319] [2022-04-28 15:10:56,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [612356319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:10:56,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:10:56,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:10:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104651239] [2022-04-28 15:10:56,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:10:56,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 15:10:56,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:10:56,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:10:56,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:10:56,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:10:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:10:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:10:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:10:56,562 INFO L87 Difference]: Start difference. First operand 20745 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)