/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_13.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 14:56:36,264 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 14:56:36,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 14:56:36,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 14:56:36,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 14:56:36,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 14:56:36,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 14:56:36,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 14:56:36,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 14:56:36,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 14:56:36,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 14:56:36,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 14:56:36,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 14:56:36,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 14:56:36,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 14:56:36,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 14:56:36,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 14:56:36,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 14:56:36,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 14:56:36,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 14:56:36,315 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 14:56:36,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 14:56:36,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 14:56:36,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 14:56:36,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 14:56:36,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 14:56:36,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 14:56:36,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 14:56:36,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 14:56:36,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 14:56:36,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 14:56:36,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 14:56:36,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 14:56:36,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 14:56:36,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 14:56:36,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 14:56:36,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 14:56:36,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 14:56:36,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 14:56:36,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 14:56:36,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 14:56:36,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 14:56:36,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-08 14:56:36,345 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 14:56:36,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 14:56:36,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 14:56:36,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 14:56:36,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 14:56:36,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 14:56:36,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 14:56:36,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 14:56:36,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 14:56:36,347 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 14:56:36,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 14:56:36,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 14:56:36,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 14:56:36,347 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 14:56:36,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 14:56:36,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 14:56:36,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 14:56:36,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 14:56:36,348 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 14:56:36,348 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 14:56:36,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 14:56:36,348 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-08 14:56:36,348 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 14:56:36,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 14:56:36,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 14:56:36,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 14:56:36,557 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 14:56:36,558 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 14:56:36,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c
[2022-04-08 14:56:36,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0a5fe41/7e46af9283204d69b21eb6e9bdbfd2c4/FLAG84bff97e8
[2022-04-08 14:56:36,998 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 14:56:36,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c
[2022-04-08 14:56:37,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0a5fe41/7e46af9283204d69b21eb6e9bdbfd2c4/FLAG84bff97e8
[2022-04-08 14:56:37,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0a5fe41/7e46af9283204d69b21eb6e9bdbfd2c4
[2022-04-08 14:56:37,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 14:56:37,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 14:56:37,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 14:56:37,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 14:56:37,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 14:56:37,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbe97c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37, skipping insertion in model container
[2022-04-08 14:56:37,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 14:56:37,050 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 14:56:37,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c[4936,4949]
[2022-04-08 14:56:37,217 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 14:56:37,225 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 14:56:37,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c[4936,4949]
[2022-04-08 14:56:37,255 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 14:56:37,265 INFO L208 MainTranslator]: Completed translation
[2022-04-08 14:56:37,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37 WrapperNode
[2022-04-08 14:56:37,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 14:56:37,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 14:56:37,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 14:56:37,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 14:56:37,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 14:56:37,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 14:56:37,305 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 14:56:37,305 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 14:56:37,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (1/1) ...
[2022-04-08 14:56:37,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 14:56:37,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 14:56:37,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 14:56:37,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 14:56:37,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 14:56:37,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 14:56:37,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 14:56:37,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 14:56:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 14:56:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 14:56:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 14:56:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 14:56:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 14:56:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 14:56:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 14:56:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 14:56:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 14:56:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 14:56:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 14:56:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 14:56:37,416 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 14:56:37,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 14:56:37,618 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 14:56:37,623 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 14:56:37,623 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 14:56:37,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:37 BoogieIcfgContainer
[2022-04-08 14:56:37,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 14:56:37,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 14:56:37,626 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 14:56:37,634 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 14:56:37,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:56:37" (1/3) ...
[2022-04-08 14:56:37,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be0d279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:37, skipping insertion in model container
[2022-04-08 14:56:37,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:37" (2/3) ...
[2022-04-08 14:56:37,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be0d279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:37, skipping insertion in model container
[2022-04-08 14:56:37,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:37" (3/3) ...
[2022-04-08 14:56:37,635 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c
[2022-04-08 14:56:37,638 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 14:56:37,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 14:56:37,668 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 14:56:37,672 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 14:56:37,672 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 14:56:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 14:56:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 14:56:37,687 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:37,687 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:37,688 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 1 times
[2022-04-08 14:56:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:37,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [6435302]
[2022-04-08 14:56:37,709 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 2 times
[2022-04-08 14:56:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:37,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551908751]
[2022-04-08 14:56:37,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:37,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:37,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {57#true} is VALID
[2022-04-08 14:56:37,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID
[2022-04-08 14:56:37,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID
[2022-04-08 14:56:37,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:37,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {57#true} is VALID
[2022-04-08 14:56:37,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID
[2022-04-08 14:56:37,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID
[2022-04-08 14:56:37,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID
[2022-04-08 14:56:37,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {57#true} is VALID
[2022-04-08 14:56:37,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {57#true} is VALID
[2022-04-08 14:56:37,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {57#true} is VALID
[2022-04-08 14:56:37,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume 0 != ~p1~0;~lk1~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p1~0; {62#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:37,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {62#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {58#false} is VALID
[2022-04-08 14:56:37,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID
[2022-04-08 14:56:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:37,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551908751]
[2022-04-08 14:56:37,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551908751] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:37,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:37,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:37,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:37,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [6435302]
[2022-04-08 14:56:37,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [6435302] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:37,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:37,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450499368]
[2022-04-08 14:56:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24
[2022-04-08 14:56:38,000 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:38,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:38,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:38,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:38,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:38,049 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:38,399 INFO L93 Difference]: Finished difference Result 106 states and 187 transitions.
[2022-04-08 14:56:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:38,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24
[2022-04-08 14:56:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions.
[2022-04-08 14:56:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions.
[2022-04-08 14:56:38,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions.
[2022-04-08 14:56:38,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:38,570 INFO L225 Difference]: With dead ends: 106
[2022-04-08 14:56:38,570 INFO L226 Difference]: Without dead ends: 91
[2022-04-08 14:56:38,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:38,574 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:38,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 107 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2022-04-08 14:56:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63.
[2022-04-08 14:56:38,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:38,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,601 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,601 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:38,613 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions.
[2022-04-08 14:56:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions.
[2022-04-08 14:56:38,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:38,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:38,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states.
[2022-04-08 14:56:38,615 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states.
[2022-04-08 14:56:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:38,619 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions.
[2022-04-08 14:56:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions.
[2022-04-08 14:56:38,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:38,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:38,620 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:38,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions.
[2022-04-08 14:56:38,624 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24
[2022-04-08 14:56:38,624 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:38,624 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions.
[2022-04-08 14:56:38,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 114 transitions.
[2022-04-08 14:56:38,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions.
[2022-04-08 14:56:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 14:56:38,709 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:38,709 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:38,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 14:56:38,710 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 1 times
[2022-04-08 14:56:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:38,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [315752264]
[2022-04-08 14:56:38,712 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 2 times
[2022-04-08 14:56:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:38,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473590349]
[2022-04-08 14:56:38,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:38,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {589#true} is VALID
[2022-04-08 14:56:38,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID
[2022-04-08 14:56:38,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID
[2022-04-08 14:56:38,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:38,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {589#true} is VALID
[2022-04-08 14:56:38,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#true} assume true; {589#true} is VALID
[2022-04-08 14:56:38,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID
[2022-04-08 14:56:38,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {589#true} call #t~ret18 := main(); {589#true} is VALID
[2022-04-08 14:56:38,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {589#true} is VALID
[2022-04-08 14:56:38,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {589#true} is VALID
[2022-04-08 14:56:38,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {589#true} is VALID
[2022-04-08 14:56:38,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#true} assume !(0 != ~p1~0); {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p2~0); {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p10~0); {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {594#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:38,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p1~0; {590#false} is VALID
[2022-04-08 14:56:38,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {590#false} assume 1 != ~lk1~0; {590#false} is VALID
[2022-04-08 14:56:38,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {590#false} assume !false; {590#false} is VALID
[2022-04-08 14:56:38,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-08 14:56:38,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:38,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473590349]
[2022-04-08 14:56:38,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473590349] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:38,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:38,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:38,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:38,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [315752264]
[2022-04-08 14:56:38,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [315752264] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:38,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:38,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779921140]
[2022-04-08 14:56:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:38,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24
[2022-04-08 14:56:38,774 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:38,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:38,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:38,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:38,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:38,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:38,790 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:38,977 INFO L93 Difference]: Finished difference Result 148 states and 273 transitions.
[2022-04-08 14:56:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:38,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24
[2022-04-08 14:56:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions.
[2022-04-08 14:56:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions.
[2022-04-08 14:56:38,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions.
[2022-04-08 14:56:39,166 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-08 14:56:39,168 INFO L225 Difference]: With dead ends: 148
[2022-04-08 14:56:39,168 INFO L226 Difference]: Without dead ends: 91
[2022-04-08 14:56:39,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:39,170 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:39,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 119 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2022-04-08 14:56:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89.
[2022-04-08 14:56:39,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:39,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,180 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,180 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:39,183 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions.
[2022-04-08 14:56:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions.
[2022-04-08 14:56:39,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:39,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:39,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states.
[2022-04-08 14:56:39,184 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states.
[2022-04-08 14:56:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:39,187 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions.
[2022-04-08 14:56:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions.
[2022-04-08 14:56:39,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:39,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:39,188 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:39,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 162 transitions.
[2022-04-08 14:56:39,191 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 162 transitions. Word has length 24
[2022-04-08 14:56:39,191 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:39,191 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 162 transitions.
[2022-04-08 14:56:39,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 162 transitions.
[2022-04-08 14:56:39,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 162 transitions.
[2022-04-08 14:56:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 14:56:39,319 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:39,319 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:39,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-08 14:56:39,319 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 1 times
[2022-04-08 14:56:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:39,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1489687861]
[2022-04-08 14:56:39,320 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 2 times
[2022-04-08 14:56:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151471815]
[2022-04-08 14:56:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:39,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1257#true} is VALID
[2022-04-08 14:56:39,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID
[2022-04-08 14:56:39,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID
[2022-04-08 14:56:39,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:39,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1257#true} is VALID
[2022-04-08 14:56:39,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID
[2022-04-08 14:56:39,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID
[2022-04-08 14:56:39,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret18 := main(); {1257#true} is VALID
[2022-04-08 14:56:39,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1257#true} is VALID
[2022-04-08 14:56:39,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {1257#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1257#true} is VALID
[2022-04-08 14:56:39,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1257#true} is VALID
[2022-04-08 14:56:39,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {1257#true} assume 0 != ~p1~0;~lk1~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:39,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1258#false} is VALID
[2022-04-08 14:56:39,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#false} assume 0 != ~p2~0; {1258#false} is VALID
[2022-04-08 14:56:39,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {1258#false} assume 1 != ~lk2~0; {1258#false} is VALID
[2022-04-08 14:56:39,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {1258#false} assume !false; {1258#false} is VALID
[2022-04-08 14:56:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:39,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:39,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151471815]
[2022-04-08 14:56:39,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151471815] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:39,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:39,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:39,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1489687861]
[2022-04-08 14:56:39,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1489687861] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:39,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:39,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424339891]
[2022-04-08 14:56:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:39,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 14:56:39,385 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:39,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:39,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:39,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:39,401 INFO L87 Difference]: Start difference. First operand 89 states and 162 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:39,585 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions.
[2022-04-08 14:56:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:39,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 14:56:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions.
[2022-04-08 14:56:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions.
[2022-04-08 14:56:39,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions.
[2022-04-08 14:56:39,731 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-08 14:56:39,733 INFO L225 Difference]: With dead ends: 136
[2022-04-08 14:56:39,733 INFO L226 Difference]: Without dead ends: 94
[2022-04-08 14:56:39,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:39,735 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:39,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2022-04-08 14:56:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92.
[2022-04-08 14:56:39,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:39,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,744 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,744 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:39,747 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions.
[2022-04-08 14:56:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions.
[2022-04-08 14:56:39,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:39,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:39,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states.
[2022-04-08 14:56:39,748 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states.
[2022-04-08 14:56:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:39,750 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions.
[2022-04-08 14:56:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions.
[2022-04-08 14:56:39,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:39,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:39,751 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:39,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions.
[2022-04-08 14:56:39,754 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 25
[2022-04-08 14:56:39,754 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:39,754 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions.
[2022-04-08 14:56:39,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 164 transitions.
[2022-04-08 14:56:39,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions.
[2022-04-08 14:56:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 14:56:39,875 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:39,876 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:39,876 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-08 14:56:39,876 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 1 times
[2022-04-08 14:56:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:39,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329811338]
[2022-04-08 14:56:39,877 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 2 times
[2022-04-08 14:56:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:39,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018577291]
[2022-04-08 14:56:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:39,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1913#true} is VALID
[2022-04-08 14:56:39,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1913#true} assume true; {1913#true} is VALID
[2022-04-08 14:56:39,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID
[2022-04-08 14:56:39,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:39,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1913#true} is VALID
[2022-04-08 14:56:39,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID
[2022-04-08 14:56:39,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID
[2022-04-08 14:56:39,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret18 := main(); {1913#true} is VALID
[2022-04-08 14:56:39,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {1913#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1913#true} is VALID
[2022-04-08 14:56:39,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {1913#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1913#true} is VALID
[2022-04-08 14:56:39,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {1913#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1913#true} is VALID
[2022-04-08 14:56:39,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {1913#true} assume !(0 != ~p1~0); {1913#true} is VALID
[2022-04-08 14:56:39,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {1913#true} assume !(0 != ~p2~0); {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1918#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:39,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p2~0; {1914#false} is VALID
[2022-04-08 14:56:39,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#false} assume 1 != ~lk2~0; {1914#false} is VALID
[2022-04-08 14:56:39,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#false} assume !false; {1914#false} is VALID
[2022-04-08 14:56:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:39,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:39,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018577291]
[2022-04-08 14:56:39,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018577291] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:39,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:39,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:39,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:39,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329811338]
[2022-04-08 14:56:39,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329811338] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:39,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:39,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:39,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458339207]
[2022-04-08 14:56:39,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:39,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 14:56:39,925 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:39,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:39,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:39,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:39,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:39,940 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:40,116 INFO L93 Difference]: Finished difference Result 256 states and 468 transitions.
[2022-04-08 14:56:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 14:56:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions.
[2022-04-08 14:56:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions.
[2022-04-08 14:56:40,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions.
[2022-04-08 14:56:40,259 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-08 14:56:40,264 INFO L225 Difference]: With dead ends: 256
[2022-04-08 14:56:40,264 INFO L226 Difference]: Without dead ends: 173
[2022-04-08 14:56:40,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:40,266 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:40,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 97 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2022-04-08 14:56:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171.
[2022-04-08 14:56:40,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:40,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,278 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,278 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:40,284 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions.
[2022-04-08 14:56:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions.
[2022-04-08 14:56:40,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:40,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:40,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states.
[2022-04-08 14:56:40,285 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states.
[2022-04-08 14:56:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:40,291 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions.
[2022-04-08 14:56:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions.
[2022-04-08 14:56:40,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:40,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:40,291 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:40,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 309 transitions.
[2022-04-08 14:56:40,298 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 309 transitions. Word has length 25
[2022-04-08 14:56:40,298 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:40,298 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 309 transitions.
[2022-04-08 14:56:40,298 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 309 transitions.
[2022-04-08 14:56:40,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 309 transitions.
[2022-04-08 14:56:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 14:56:40,519 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:40,519 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:40,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-04-08 14:56:40,519 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 1 times
[2022-04-08 14:56:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:40,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345316662]
[2022-04-08 14:56:40,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 2 times
[2022-04-08 14:56:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:40,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541673144]
[2022-04-08 14:56:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:40,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3125#true} is VALID
[2022-04-08 14:56:40,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {3125#true} assume true; {3125#true} is VALID
[2022-04-08 14:56:40,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID
[2022-04-08 14:56:40,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {3125#true} call ULTIMATE.init(); {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:40,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3125#true} is VALID
[2022-04-08 14:56:40,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {3125#true} assume true; {3125#true} is VALID
[2022-04-08 14:56:40,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID
[2022-04-08 14:56:40,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {3125#true} call #t~ret18 := main(); {3125#true} is VALID
[2022-04-08 14:56:40,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {3125#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {3125#true} is VALID
[2022-04-08 14:56:40,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {3125#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {3125#true} is VALID
[2022-04-08 14:56:40,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {3125#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {3125#true} is VALID
[2022-04-08 14:56:40,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {3125#true} assume !(0 != ~p1~0); {3125#true} is VALID
[2022-04-08 14:56:40,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {3125#true} assume 0 != ~p2~0;~lk2~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3130#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:40,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3126#false} is VALID
[2022-04-08 14:56:40,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {3126#false} assume !false; {3126#false} is VALID
[2022-04-08 14:56:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:40,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541673144]
[2022-04-08 14:56:40,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541673144] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:40,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:40,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:40,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:40,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345316662]
[2022-04-08 14:56:40,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345316662] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:40,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:40,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802192419]
[2022-04-08 14:56:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 14:56:40,567 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:40,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:40,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:40,581 INFO L87 Difference]: Start difference. First operand 171 states and 309 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:40,756 INFO L93 Difference]: Finished difference Result 223 states and 403 transitions.
[2022-04-08 14:56:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:40,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 14:56:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions.
[2022-04-08 14:56:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions.
[2022-04-08 14:56:40,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions.
[2022-04-08 14:56:40,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:40,863 INFO L225 Difference]: With dead ends: 223
[2022-04-08 14:56:40,863 INFO L226 Difference]: Without dead ends: 221
[2022-04-08 14:56:40,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:40,864 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:40,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states.
[2022-04-08 14:56:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 171.
[2022-04-08 14:56:40,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:40,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,875 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,876 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:40,884 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions.
[2022-04-08 14:56:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions.
[2022-04-08 14:56:40,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:40,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:40,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states.
[2022-04-08 14:56:40,885 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states.
[2022-04-08 14:56:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:40,894 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions.
[2022-04-08 14:56:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions.
[2022-04-08 14:56:40,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:40,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:40,894 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:40,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 307 transitions.
[2022-04-08 14:56:40,901 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 307 transitions. Word has length 25
[2022-04-08 14:56:40,901 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:40,901 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 307 transitions.
[2022-04-08 14:56:40,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:40,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 307 transitions.
[2022-04-08 14:56:41,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 307 transitions.
[2022-04-08 14:56:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 14:56:41,146 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:41,146 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:41,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-04-08 14:56:41,146 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:41,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 1 times
[2022-04-08 14:56:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:41,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1035207112]
[2022-04-08 14:56:41,147 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 2 times
[2022-04-08 14:56:41,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:41,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365735327]
[2022-04-08 14:56:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:41,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:41,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4367#true} is VALID
[2022-04-08 14:56:41,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {4367#true} assume true; {4367#true} is VALID
[2022-04-08 14:56:41,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID
[2022-04-08 14:56:41,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {4367#true} call ULTIMATE.init(); {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:41,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4367#true} is VALID
[2022-04-08 14:56:41,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {4367#true} assume true; {4367#true} is VALID
[2022-04-08 14:56:41,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID
[2022-04-08 14:56:41,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {4367#true} call #t~ret18 := main(); {4367#true} is VALID
[2022-04-08 14:56:41,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {4367#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {4367#true} is VALID
[2022-04-08 14:56:41,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {4367#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {4367#true} is VALID
[2022-04-08 14:56:41,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {4367#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {4367#true} is VALID
[2022-04-08 14:56:41,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {4367#true} assume !(0 != ~p1~0); {4367#true} is VALID
[2022-04-08 14:56:41,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {4367#true} assume !(0 != ~p2~0); {4367#true} is VALID
[2022-04-08 14:56:41,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {4367#true} assume 0 != ~p3~0;~lk3~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4372#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:41,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {4372#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4368#false} is VALID
[2022-04-08 14:56:41,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {4368#false} assume !false; {4368#false} is VALID
[2022-04-08 14:56:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:41,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:41,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365735327]
[2022-04-08 14:56:41,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365735327] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:41,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:41,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:41,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:41,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1035207112]
[2022-04-08 14:56:41,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1035207112] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:41,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:41,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:41,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861896811]
[2022-04-08 14:56:41,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 14:56:41,196 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:41,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:41,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:41,215 INFO L87 Difference]: Start difference. First operand 171 states and 307 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:41,401 INFO L93 Difference]: Finished difference Result 323 states and 587 transitions.
[2022-04-08 14:56:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:41,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 14:56:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions.
[2022-04-08 14:56:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions.
[2022-04-08 14:56:41,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions.
[2022-04-08 14:56:41,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:41,504 INFO L225 Difference]: With dead ends: 323
[2022-04-08 14:56:41,504 INFO L226 Difference]: Without dead ends: 321
[2022-04-08 14:56:41,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:41,505 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:41,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2022-04-08 14:56:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 231.
[2022-04-08 14:56:41,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:41,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,517 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,518 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:41,524 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions.
[2022-04-08 14:56:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions.
[2022-04-08 14:56:41,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:41,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:41,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states.
[2022-04-08 14:56:41,525 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states.
[2022-04-08 14:56:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:41,531 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions.
[2022-04-08 14:56:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions.
[2022-04-08 14:56:41,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:41,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:41,532 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:41,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 413 transitions.
[2022-04-08 14:56:41,536 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 413 transitions. Word has length 26
[2022-04-08 14:56:41,536 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:41,536 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 413 transitions.
[2022-04-08 14:56:41,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 413 transitions.
[2022-04-08 14:56:41,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 413 transitions.
[2022-04-08 14:56:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 14:56:41,857 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:41,857 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:41,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-04-08 14:56:41,858 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 1 times
[2022-04-08 14:56:41,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:41,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1812621616]
[2022-04-08 14:56:41,858 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 2 times
[2022-04-08 14:56:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665011988]
[2022-04-08 14:56:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:41,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:41,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:41,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6129#true} is VALID
[2022-04-08 14:56:41,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {6129#true} assume true; {6129#true} is VALID
[2022-04-08 14:56:41,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID
[2022-04-08 14:56:41,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {6129#true} call ULTIMATE.init(); {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:41,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6129#true} is VALID
[2022-04-08 14:56:41,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {6129#true} assume true; {6129#true} is VALID
[2022-04-08 14:56:41,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID
[2022-04-08 14:56:41,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {6129#true} call #t~ret18 := main(); {6129#true} is VALID
[2022-04-08 14:56:41,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {6129#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {6129#true} is VALID
[2022-04-08 14:56:41,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {6129#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {6129#true} is VALID
[2022-04-08 14:56:41,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {6129#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {6129#true} is VALID
[2022-04-08 14:56:41,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {6129#true} assume !(0 != ~p1~0); {6129#true} is VALID
[2022-04-08 14:56:41,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {6129#true} assume !(0 != ~p2~0); {6129#true} is VALID
[2022-04-08 14:56:41,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {6129#true} assume !(0 != ~p3~0); {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6134#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:41,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p3~0; {6130#false} is VALID
[2022-04-08 14:56:41,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {6130#false} assume 1 != ~lk3~0; {6130#false} is VALID
[2022-04-08 14:56:41,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {6130#false} assume !false; {6130#false} is VALID
[2022-04-08 14:56:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:41,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:41,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665011988]
[2022-04-08 14:56:41,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665011988] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:41,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:41,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:41,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:41,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1812621616]
[2022-04-08 14:56:41,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1812621616] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:41,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:41,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:41,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211727405]
[2022-04-08 14:56:41,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 14:56:41,900 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:41,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:41,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:41,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:41,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:41,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:41,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:41,915 INFO L87 Difference]: Start difference. First operand 231 states and 413 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:42,129 INFO L93 Difference]: Finished difference Result 551 states and 995 transitions.
[2022-04-08 14:56:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:42,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 14:56:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions.
[2022-04-08 14:56:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions.
[2022-04-08 14:56:42,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions.
[2022-04-08 14:56:42,280 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-08 14:56:42,285 INFO L225 Difference]: With dead ends: 551
[2022-04-08 14:56:42,285 INFO L226 Difference]: Without dead ends: 329
[2022-04-08 14:56:42,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:42,286 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:42,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 123 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states.
[2022-04-08 14:56:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327.
[2022-04-08 14:56:42,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:42,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,303 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,304 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:42,309 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions.
[2022-04-08 14:56:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions.
[2022-04-08 14:56:42,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:42,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:42,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states.
[2022-04-08 14:56:42,310 INFO L87 Difference]: Start difference. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states.
[2022-04-08 14:56:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:42,315 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions.
[2022-04-08 14:56:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions.
[2022-04-08 14:56:42,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:42,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:42,316 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:42,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 583 transitions.
[2022-04-08 14:56:42,322 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 583 transitions. Word has length 26
[2022-04-08 14:56:42,322 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:42,322 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 583 transitions.
[2022-04-08 14:56:42,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 583 transitions.
[2022-04-08 14:56:42,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 583 transitions.
[2022-04-08 14:56:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 14:56:42,792 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:42,792 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:42,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-04-08 14:56:42,793 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 1 times
[2022-04-08 14:56:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:42,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542470199]
[2022-04-08 14:56:42,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 2 times
[2022-04-08 14:56:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:42,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69780470]
[2022-04-08 14:56:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:42,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8555#true} is VALID
[2022-04-08 14:56:42,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {8555#true} assume true; {8555#true} is VALID
[2022-04-08 14:56:42,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {8555#true} call ULTIMATE.init(); {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:42,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {8555#true} assume true; {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {8555#true} call #t~ret18 := main(); {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {8555#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {8555#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {8555#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {8555#true} assume !(0 != ~p1~0); {8555#true} is VALID
[2022-04-08 14:56:42,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {8555#true} assume !(0 != ~p2~0); {8555#true} is VALID
[2022-04-08 14:56:42,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {8555#true} assume 0 != ~p3~0;~lk3~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {8560#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:42,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {8556#false} is VALID
[2022-04-08 14:56:42,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {8556#false} assume 0 != ~p4~0; {8556#false} is VALID
[2022-04-08 14:56:42,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {8556#false} assume 1 != ~lk4~0; {8556#false} is VALID
[2022-04-08 14:56:42,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {8556#false} assume !false; {8556#false} is VALID
[2022-04-08 14:56:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:42,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69780470]
[2022-04-08 14:56:42,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69780470] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:42,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:42,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:42,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542470199]
[2022-04-08 14:56:42,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542470199] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:42,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:42,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:42,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859808053]
[2022-04-08 14:56:42,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:42,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 14:56:42,834 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:42,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:42,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:42,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:42,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:42,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:42,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:42,850 INFO L87 Difference]: Start difference. First operand 327 states and 583 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:43,085 INFO L93 Difference]: Finished difference Result 493 states and 877 transitions.
[2022-04-08 14:56:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:43,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 14:56:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions.
[2022-04-08 14:56:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions.
[2022-04-08 14:56:43,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions.
[2022-04-08 14:56:43,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:43,249 INFO L225 Difference]: With dead ends: 493
[2022-04-08 14:56:43,249 INFO L226 Difference]: Without dead ends: 335
[2022-04-08 14:56:43,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:43,250 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 168 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:43,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 137 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states.
[2022-04-08 14:56:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333.
[2022-04-08 14:56:43,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:43,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,271 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,272 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:43,277 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions.
[2022-04-08 14:56:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions.
[2022-04-08 14:56:43,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:43,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:43,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states.
[2022-04-08 14:56:43,279 INFO L87 Difference]: Start difference. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states.
[2022-04-08 14:56:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:43,284 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions.
[2022-04-08 14:56:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions.
[2022-04-08 14:56:43,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:43,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:43,285 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:43,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 587 transitions.
[2022-04-08 14:56:43,291 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 587 transitions. Word has length 27
[2022-04-08 14:56:43,291 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:43,291 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 587 transitions.
[2022-04-08 14:56:43,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 587 transitions.
[2022-04-08 14:56:43,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 587 transitions.
[2022-04-08 14:56:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 14:56:43,772 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:43,772 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:43,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-04-08 14:56:43,772 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 1 times
[2022-04-08 14:56:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:43,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312833416]
[2022-04-08 14:56:43,773 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 2 times
[2022-04-08 14:56:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:43,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548245680]
[2022-04-08 14:56:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:43,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:43,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10889#true} is VALID
[2022-04-08 14:56:43,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {10889#true} assume true; {10889#true} is VALID
[2022-04-08 14:56:43,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID
[2022-04-08 14:56:43,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:43,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10889#true} is VALID
[2022-04-08 14:56:43,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {10889#true} assume true; {10889#true} is VALID
[2022-04-08 14:56:43,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID
[2022-04-08 14:56:43,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {10889#true} call #t~ret18 := main(); {10889#true} is VALID
[2022-04-08 14:56:43,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {10889#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {10889#true} is VALID
[2022-04-08 14:56:43,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {10889#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {10889#true} is VALID
[2022-04-08 14:56:43,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {10889#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {10889#true} is VALID
[2022-04-08 14:56:43,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {10889#true} assume !(0 != ~p1~0); {10889#true} is VALID
[2022-04-08 14:56:43,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {10889#true} assume !(0 != ~p2~0); {10889#true} is VALID
[2022-04-08 14:56:43,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {10889#true} assume !(0 != ~p3~0); {10889#true} is VALID
[2022-04-08 14:56:43,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {10889#true} assume 0 != ~p4~0;~lk4~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10894#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:43,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {10894#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10890#false} is VALID
[2022-04-08 14:56:43,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#false} assume !false; {10890#false} is VALID
[2022-04-08 14:56:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:43,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548245680]
[2022-04-08 14:56:43,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548245680] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:43,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:43,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:43,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:43,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312833416]
[2022-04-08 14:56:43,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312833416] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:43,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:43,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:43,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047662303]
[2022-04-08 14:56:43,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:43,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 14:56:43,811 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:43,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:43,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:43,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:43,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:43,828 INFO L87 Difference]: Start difference. First operand 333 states and 587 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:44,042 INFO L93 Difference]: Finished difference Result 621 states and 1109 transitions.
[2022-04-08 14:56:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:44,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 14:56:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions.
[2022-04-08 14:56:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions.
[2022-04-08 14:56:44,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions.
[2022-04-08 14:56:44,166 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-08 14:56:44,182 INFO L225 Difference]: With dead ends: 621
[2022-04-08 14:56:44,182 INFO L226 Difference]: Without dead ends: 619
[2022-04-08 14:56:44,182 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:44,183 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:44,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 93 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states.
[2022-04-08 14:56:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457.
[2022-04-08 14:56:44,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:44,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,205 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,206 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:44,218 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions.
[2022-04-08 14:56:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions.
[2022-04-08 14:56:44,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:44,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:44,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states.
[2022-04-08 14:56:44,220 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states.
[2022-04-08 14:56:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:44,233 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions.
[2022-04-08 14:56:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions.
[2022-04-08 14:56:44,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:44,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:44,233 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:44,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 795 transitions.
[2022-04-08 14:56:44,244 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 795 transitions. Word has length 27
[2022-04-08 14:56:44,244 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:44,244 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 795 transitions.
[2022-04-08 14:56:44,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 795 transitions.
[2022-04-08 14:56:44,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 795 edges. 795 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 795 transitions.
[2022-04-08 14:56:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 14:56:44,907 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:44,907 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:44,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-04-08 14:56:44,907 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 1 times
[2022-04-08 14:56:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:44,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [937226390]
[2022-04-08 14:56:44,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 2 times
[2022-04-08 14:56:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:44,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590991604]
[2022-04-08 14:56:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:44,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14295#true} is VALID
[2022-04-08 14:56:44,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} assume true; {14295#true} is VALID
[2022-04-08 14:56:44,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID
[2022-04-08 14:56:44,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:44,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14295#true} is VALID
[2022-04-08 14:56:44,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {14295#true} assume true; {14295#true} is VALID
[2022-04-08 14:56:44,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID
[2022-04-08 14:56:44,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {14295#true} call #t~ret18 := main(); {14295#true} is VALID
[2022-04-08 14:56:44,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {14295#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {14295#true} is VALID
[2022-04-08 14:56:44,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {14295#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {14295#true} is VALID
[2022-04-08 14:56:44,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {14295#true} is VALID
[2022-04-08 14:56:44,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 != ~p1~0); {14295#true} is VALID
[2022-04-08 14:56:44,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume !(0 != ~p2~0); {14295#true} is VALID
[2022-04-08 14:56:44,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {14295#true} assume !(0 != ~p3~0); {14295#true} is VALID
[2022-04-08 14:56:44,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {14295#true} assume !(0 != ~p4~0); {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p10~0); {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p1~0); {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p2~0); {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p3~0); {14300#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:44,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p4~0; {14296#false} is VALID
[2022-04-08 14:56:44,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {14296#false} assume 1 != ~lk4~0; {14296#false} is VALID
[2022-04-08 14:56:44,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {14296#false} assume !false; {14296#false} is VALID
[2022-04-08 14:56:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:44,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:44,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590991604]
[2022-04-08 14:56:44,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590991604] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:44,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:44,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:44,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:44,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [937226390]
[2022-04-08 14:56:44,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [937226390] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:44,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:44,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:44,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477388977]
[2022-04-08 14:56:44,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:44,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 14:56:44,950 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:44,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:44,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:44,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:44,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:44,969 INFO L87 Difference]: Start difference. First operand 457 states and 795 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:45,233 INFO L93 Difference]: Finished difference Result 1085 states and 1901 transitions.
[2022-04-08 14:56:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:45,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 14:56:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions.
[2022-04-08 14:56:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions.
[2022-04-08 14:56:45,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 237 transitions.
[2022-04-08 14:56:45,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:45,403 INFO L225 Difference]: With dead ends: 1085
[2022-04-08 14:56:45,403 INFO L226 Difference]: Without dead ends: 643
[2022-04-08 14:56:45,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:45,404 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:45,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 125 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states.
[2022-04-08 14:56:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641.
[2022-04-08 14:56:45,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:45,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:45,437 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:45,438 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:45,451 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions.
[2022-04-08 14:56:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions.
[2022-04-08 14:56:45,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:45,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:45,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states.
[2022-04-08 14:56:45,453 INFO L87 Difference]: Start difference. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states.
[2022-04-08 14:56:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:45,467 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions.
[2022-04-08 14:56:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions.
[2022-04-08 14:56:45,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:45,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:45,468 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:45,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1111 transitions.
[2022-04-08 14:56:45,486 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1111 transitions. Word has length 27
[2022-04-08 14:56:45,486 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:45,486 INFO L478 AbstractCegarLoop]: Abstraction has 641 states and 1111 transitions.
[2022-04-08 14:56:45,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:45,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 641 states and 1111 transitions.
[2022-04-08 14:56:46,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1111 transitions.
[2022-04-08 14:56:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 14:56:46,476 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:46,477 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:46,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-04-08 14:56:46,477 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 1 times
[2022-04-08 14:56:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:46,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578992706]
[2022-04-08 14:56:46,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 2 times
[2022-04-08 14:56:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:46,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045761086]
[2022-04-08 14:56:46,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:46,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:46,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {19045#true} is VALID
[2022-04-08 14:56:46,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {19045#true} assume true; {19045#true} is VALID
[2022-04-08 14:56:46,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID
[2022-04-08 14:56:46,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {19045#true} call ULTIMATE.init(); {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:46,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {19045#true} is VALID
[2022-04-08 14:56:46,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {19045#true} assume true; {19045#true} is VALID
[2022-04-08 14:56:46,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID
[2022-04-08 14:56:46,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {19045#true} call #t~ret18 := main(); {19045#true} is VALID
[2022-04-08 14:56:46,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {19045#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {19045#true} is VALID
[2022-04-08 14:56:46,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {19045#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {19045#true} is VALID
[2022-04-08 14:56:46,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {19045#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {19045#true} is VALID
[2022-04-08 14:56:46,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {19045#true} assume !(0 != ~p1~0); {19045#true} is VALID
[2022-04-08 14:56:46,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {19045#true} assume !(0 != ~p2~0); {19045#true} is VALID
[2022-04-08 14:56:46,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {19045#true} assume !(0 != ~p3~0); {19045#true} is VALID
[2022-04-08 14:56:46,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {19045#true} assume 0 != ~p4~0;~lk4~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {19050#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:46,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {19046#false} is VALID
[2022-04-08 14:56:46,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {19046#false} assume 0 != ~p5~0; {19046#false} is VALID
[2022-04-08 14:56:46,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {19046#false} assume 1 != ~lk5~0; {19046#false} is VALID
[2022-04-08 14:56:46,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {19046#false} assume !false; {19046#false} is VALID
[2022-04-08 14:56:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:46,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045761086]
[2022-04-08 14:56:46,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045761086] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:46,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:46,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:46,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:46,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578992706]
[2022-04-08 14:56:46,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578992706] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:46,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:46,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:46,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106075357]
[2022-04-08 14:56:46,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:46,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 14:56:46,565 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:46,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:46,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:46,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:46,577 INFO L87 Difference]: Start difference. First operand 641 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:46,868 INFO L93 Difference]: Finished difference Result 961 states and 1661 transitions.
[2022-04-08 14:56:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 14:56:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions.
[2022-04-08 14:56:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions.
[2022-04-08 14:56:46,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 232 transitions.
[2022-04-08 14:56:47,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:47,039 INFO L225 Difference]: With dead ends: 961
[2022-04-08 14:56:47,040 INFO L226 Difference]: Without dead ends: 651
[2022-04-08 14:56:47,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:47,041 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:47,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 134 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states.
[2022-04-08 14:56:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649.
[2022-04-08 14:56:47,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:47,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:47,076 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:47,076 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:47,091 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions.
[2022-04-08 14:56:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions.
[2022-04-08 14:56:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:47,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:47,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states.
[2022-04-08 14:56:47,093 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states.
[2022-04-08 14:56:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:47,107 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions.
[2022-04-08 14:56:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions.
[2022-04-08 14:56:47,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:47,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:47,107 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:47,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1111 transitions.
[2022-04-08 14:56:47,128 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1111 transitions. Word has length 28
[2022-04-08 14:56:47,128 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:47,128 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 1111 transitions.
[2022-04-08 14:56:47,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:47,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1111 transitions.
[2022-04-08 14:56:48,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1111 transitions.
[2022-04-08 14:56:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 14:56:48,135 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:48,135 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:48,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-04-08 14:56:48,135 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:48,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 1 times
[2022-04-08 14:56:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:48,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493958078]
[2022-04-08 14:56:48,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 2 times
[2022-04-08 14:56:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:48,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835460744]
[2022-04-08 14:56:48,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:48,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23579#true} is VALID
[2022-04-08 14:56:48,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {23579#true} assume true; {23579#true} is VALID
[2022-04-08 14:56:48,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID
[2022-04-08 14:56:48,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {23579#true} call ULTIMATE.init(); {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:48,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23579#true} is VALID
[2022-04-08 14:56:48,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {23579#true} assume true; {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {23579#true} call #t~ret18 := main(); {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {23579#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {23579#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {23579#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {23579#true} assume !(0 != ~p1~0); {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {23579#true} assume !(0 != ~p2~0); {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {23579#true} assume !(0 != ~p3~0); {23579#true} is VALID
[2022-04-08 14:56:48,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {23579#true} assume !(0 != ~p4~0); {23579#true} is VALID
[2022-04-08 14:56:48,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {23579#true} assume 0 != ~p5~0;~lk5~0 := 1; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p5~0; {23584#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:48,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {23584#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {23580#false} is VALID
[2022-04-08 14:56:48,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {23580#false} assume !false; {23580#false} is VALID
[2022-04-08 14:56:48,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-08 14:56:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835460744]
[2022-04-08 14:56:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835460744] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:48,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:48,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493958078]
[2022-04-08 14:56:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493958078] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:48,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507862311]
[2022-04-08 14:56:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 14:56:48,212 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:48,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:48,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:48,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:48,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:48,227 INFO L87 Difference]: Start difference. First operand 649 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:48,497 INFO L93 Difference]: Finished difference Result 1197 states and 2081 transitions.
[2022-04-08 14:56:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 14:56:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions.
[2022-04-08 14:56:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions.
[2022-04-08 14:56:48,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions.
[2022-04-08 14:56:48,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:48,649 INFO L225 Difference]: With dead ends: 1197
[2022-04-08 14:56:48,649 INFO L226 Difference]: Without dead ends: 1195
[2022-04-08 14:56:48,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:48,650 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:48,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states.
[2022-04-08 14:56:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 905.
[2022-04-08 14:56:48,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:48,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,723 INFO L74 IsIncluded]: Start isIncluded. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,723 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:48,760 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions.
[2022-04-08 14:56:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions.
[2022-04-08 14:56:48,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:48,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:48,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1195 states.
[2022-04-08 14:56:48,763 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1195 states.
[2022-04-08 14:56:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:48,800 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions.
[2022-04-08 14:56:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions.
[2022-04-08 14:56:48,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:48,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:48,802 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:48,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1519 transitions.
[2022-04-08 14:56:48,835 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1519 transitions. Word has length 28
[2022-04-08 14:56:48,835 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:48,836 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1519 transitions.
[2022-04-08 14:56:48,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:48,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1519 transitions.
[2022-04-08 14:56:49,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1519 edges. 1519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1519 transitions.
[2022-04-08 14:56:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 14:56:49,983 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:49,983 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:49,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-04-08 14:56:49,983 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 1 times
[2022-04-08 14:56:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:49,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233102279]
[2022-04-08 14:56:49,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 2 times
[2022-04-08 14:56:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:49,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437610066]
[2022-04-08 14:56:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:50,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30185#true} is VALID
[2022-04-08 14:56:50,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {30185#true} assume true; {30185#true} is VALID
[2022-04-08 14:56:50,055 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID
[2022-04-08 14:56:50,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {30185#true} call ULTIMATE.init(); {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:50,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {30185#true} assume true; {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {30185#true} call #t~ret18 := main(); {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {30185#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {30185#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {30185#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {30185#true} assume !(0 != ~p1~0); {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {30185#true} assume !(0 != ~p2~0); {30185#true} is VALID
[2022-04-08 14:56:50,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {30185#true} assume !(0 != ~p3~0); {30185#true} is VALID
[2022-04-08 14:56:50,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {30185#true} assume !(0 != ~p4~0); {30185#true} is VALID
[2022-04-08 14:56:50,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {30185#true} assume !(0 != ~p5~0); {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p10~0); {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p1~0); {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p2~0); {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p3~0); {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p4~0); {30190#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:50,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p5~0; {30186#false} is VALID
[2022-04-08 14:56:50,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {30186#false} assume 1 != ~lk5~0; {30186#false} is VALID
[2022-04-08 14:56:50,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {30186#false} assume !false; {30186#false} is VALID
[2022-04-08 14:56:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:50,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:50,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437610066]
[2022-04-08 14:56:50,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437610066] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:50,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:50,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:50,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:50,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233102279]
[2022-04-08 14:56:50,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233102279] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:50,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:50,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:50,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468980606]
[2022-04-08 14:56:50,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 14:56:50,067 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:50,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:50,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:50,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:50,088 INFO L87 Difference]: Start difference. First operand 905 states and 1519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:50,523 INFO L93 Difference]: Finished difference Result 2141 states and 3617 transitions.
[2022-04-08 14:56:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 14:56:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions.
[2022-04-08 14:56:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions.
[2022-04-08 14:56:50,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 234 transitions.
[2022-04-08 14:56:50,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:50,726 INFO L225 Difference]: With dead ends: 2141
[2022-04-08 14:56:50,726 INFO L226 Difference]: Without dead ends: 1259
[2022-04-08 14:56:50,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:50,727 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:50,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states.
[2022-04-08 14:56:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1257.
[2022-04-08 14:56:50,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:50,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,800 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,801 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:50,840 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions.
[2022-04-08 14:56:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions.
[2022-04-08 14:56:50,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:50,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:50,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1259 states.
[2022-04-08 14:56:50,844 INFO L87 Difference]: Start difference. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1259 states.
[2022-04-08 14:56:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:50,883 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions.
[2022-04-08 14:56:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions.
[2022-04-08 14:56:50,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:50,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:50,884 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:50,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2103 transitions.
[2022-04-08 14:56:50,946 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2103 transitions. Word has length 28
[2022-04-08 14:56:50,946 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:50,946 INFO L478 AbstractCegarLoop]: Abstraction has 1257 states and 2103 transitions.
[2022-04-08 14:56:50,949 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:50,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1257 states and 2103 transitions.
[2022-04-08 14:56:52,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2103 transitions.
[2022-04-08 14:56:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 14:56:52,747 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:52,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:52,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-04-08 14:56:52,748 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 1 times
[2022-04-08 14:56:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:52,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120244939]
[2022-04-08 14:56:52,748 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 2 times
[2022-04-08 14:56:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:52,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630732505]
[2022-04-08 14:56:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:52,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {39511#true} is VALID
[2022-04-08 14:56:52,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {39511#true} assume true; {39511#true} is VALID
[2022-04-08 14:56:52,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID
[2022-04-08 14:56:52,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {39511#true} call ULTIMATE.init(); {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:52,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {39511#true} is VALID
[2022-04-08 14:56:52,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {39511#true} assume true; {39511#true} is VALID
[2022-04-08 14:56:52,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID
[2022-04-08 14:56:52,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {39511#true} call #t~ret18 := main(); {39511#true} is VALID
[2022-04-08 14:56:52,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {39511#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {39511#true} is VALID
[2022-04-08 14:56:52,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {39511#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {39511#true} is VALID
[2022-04-08 14:56:52,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {39511#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {39511#true} is VALID
[2022-04-08 14:56:52,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {39511#true} assume !(0 != ~p1~0); {39511#true} is VALID
[2022-04-08 14:56:52,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {39511#true} assume !(0 != ~p2~0); {39511#true} is VALID
[2022-04-08 14:56:52,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {39511#true} assume !(0 != ~p3~0); {39511#true} is VALID
[2022-04-08 14:56:52,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {39511#true} assume !(0 != ~p4~0); {39511#true} is VALID
[2022-04-08 14:56:52,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {39511#true} assume 0 != ~p5~0;~lk5~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {39516#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:52,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {39512#false} is VALID
[2022-04-08 14:56:52,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {39512#false} assume 0 != ~p6~0; {39512#false} is VALID
[2022-04-08 14:56:52,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {39512#false} assume 1 != ~lk6~0; {39512#false} is VALID
[2022-04-08 14:56:52,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {39512#false} assume !false; {39512#false} is VALID
[2022-04-08 14:56:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:52,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630732505]
[2022-04-08 14:56:52,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630732505] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:52,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:52,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:52,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2120244939]
[2022-04-08 14:56:52,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2120244939] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:52,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:52,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907437898]
[2022-04-08 14:56:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:52,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 14:56:52,823 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:52,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:52,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:52,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:52,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:52,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:52,839 INFO L87 Difference]: Start difference. First operand 1257 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:53,234 INFO L93 Difference]: Finished difference Result 1885 states and 3145 transitions.
[2022-04-08 14:56:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:53,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 14:56:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions.
[2022-04-08 14:56:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions.
[2022-04-08 14:56:53,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 229 transitions.
[2022-04-08 14:56:53,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:53,439 INFO L225 Difference]: With dead ends: 1885
[2022-04-08 14:56:53,439 INFO L226 Difference]: Without dead ends: 1275
[2022-04-08 14:56:53,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:53,440 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:53,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states.
[2022-04-08 14:56:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1273.
[2022-04-08 14:56:53,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:53,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:53,517 INFO L74 IsIncluded]: Start isIncluded. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:53,518 INFO L87 Difference]: Start difference. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:53,557 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions.
[2022-04-08 14:56:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions.
[2022-04-08 14:56:53,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:53,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:53,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1275 states.
[2022-04-08 14:56:53,561 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1275 states.
[2022-04-08 14:56:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:53,606 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions.
[2022-04-08 14:56:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions.
[2022-04-08 14:56:53,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:53,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:53,607 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:53,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2103 transitions.
[2022-04-08 14:56:53,670 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2103 transitions. Word has length 29
[2022-04-08 14:56:53,670 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:53,670 INFO L478 AbstractCegarLoop]: Abstraction has 1273 states and 2103 transitions.
[2022-04-08 14:56:53,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:53,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1273 states and 2103 transitions.
[2022-04-08 14:56:55,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2103 transitions.
[2022-04-08 14:56:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 14:56:55,628 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:55,629 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:55,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-04-08 14:56:55,629 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 1 times
[2022-04-08 14:56:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:55,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390435530]
[2022-04-08 14:56:55,631 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 2 times
[2022-04-08 14:56:55,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:55,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8479878]
[2022-04-08 14:56:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:55,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:55,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48389#true} is VALID
[2022-04-08 14:56:55,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {48389#true} assume true; {48389#true} is VALID
[2022-04-08 14:56:55,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID
[2022-04-08 14:56:55,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {48389#true} call ULTIMATE.init(); {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:55,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48389#true} is VALID
[2022-04-08 14:56:55,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {48389#true} assume true; {48389#true} is VALID
[2022-04-08 14:56:55,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {48389#true} call #t~ret18 := main(); {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {48389#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {48389#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {48389#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {48389#true} assume !(0 != ~p1~0); {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {48389#true} assume !(0 != ~p2~0); {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {48389#true} assume !(0 != ~p3~0); {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {48389#true} assume !(0 != ~p4~0); {48389#true} is VALID
[2022-04-08 14:56:55,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {48389#true} assume !(0 != ~p5~0); {48389#true} is VALID
[2022-04-08 14:56:55,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {48389#true} assume 0 != ~p6~0;~lk6~0 := 1; {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p6~0; {48394#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:55,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {48394#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {48390#false} is VALID
[2022-04-08 14:56:55,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {48390#false} assume !false; {48390#false} is VALID
[2022-04-08 14:56:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:55,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8479878]
[2022-04-08 14:56:55,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8479878] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:55,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:55,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:55,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:55,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390435530]
[2022-04-08 14:56:55,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390435530] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:55,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:55,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639461672]
[2022-04-08 14:56:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 14:56:55,688 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:55,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:55,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:55,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:55,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:55,709 INFO L87 Difference]: Start difference. First operand 1273 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:56,233 INFO L93 Difference]: Finished difference Result 2317 states and 3897 transitions.
[2022-04-08 14:56:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:56,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 14:56:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions.
[2022-04-08 14:56:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions.
[2022-04-08 14:56:56,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions.
[2022-04-08 14:56:56,336 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-08 14:56:56,558 INFO L225 Difference]: With dead ends: 2317
[2022-04-08 14:56:56,559 INFO L226 Difference]: Without dead ends: 2315
[2022-04-08 14:56:56,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:56,559 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:56,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states.
[2022-04-08 14:56:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1801.
[2022-04-08 14:56:56,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:56,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:56,666 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:56,668 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:56,789 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions.
[2022-04-08 14:56:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions.
[2022-04-08 14:56:56,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:56,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:56,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states.
[2022-04-08 14:56:56,795 INFO L87 Difference]: Start difference. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states.
[2022-04-08 14:56:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:56,919 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions.
[2022-04-08 14:56:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions.
[2022-04-08 14:56:56,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:56,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:56,921 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:56,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2903 transitions.
[2022-04-08 14:56:57,067 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2903 transitions. Word has length 29
[2022-04-08 14:56:57,068 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:57,068 INFO L478 AbstractCegarLoop]: Abstraction has 1801 states and 2903 transitions.
[2022-04-08 14:56:57,068 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:57,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1801 states and 2903 transitions.
[2022-04-08 14:56:59,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2903 edges. 2903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2903 transitions.
[2022-04-08 14:56:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 14:56:59,751 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:59,751 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:59,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-04-08 14:56:59,751 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 1 times
[2022-04-08 14:56:59,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:59,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [726124773]
[2022-04-08 14:56:59,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 2 times
[2022-04-08 14:56:59,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:59,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692268997]
[2022-04-08 14:56:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:59,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:59,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61267#true} is VALID
[2022-04-08 14:56:59,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {61267#true} assume true; {61267#true} is VALID
[2022-04-08 14:56:59,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {61267#true} call ULTIMATE.init(); {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:59,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {61267#true} assume true; {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {61267#true} call #t~ret18 := main(); {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {61267#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {61267#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {61267#true} assume !(0 != ~p1~0); {61267#true} is VALID
[2022-04-08 14:56:59,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {61267#true} assume !(0 != ~p2~0); {61267#true} is VALID
[2022-04-08 14:56:59,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {61267#true} assume !(0 != ~p3~0); {61267#true} is VALID
[2022-04-08 14:56:59,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {61267#true} assume !(0 != ~p4~0); {61267#true} is VALID
[2022-04-08 14:56:59,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {61267#true} assume !(0 != ~p5~0); {61267#true} is VALID
[2022-04-08 14:56:59,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {61267#true} assume !(0 != ~p6~0); {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p10~0); {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p1~0); {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p2~0); {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p3~0); {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p4~0); {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p5~0); {61272#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:59,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p6~0; {61268#false} is VALID
[2022-04-08 14:56:59,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {61268#false} assume 1 != ~lk6~0; {61268#false} is VALID
[2022-04-08 14:56:59,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {61268#false} assume !false; {61268#false} is VALID
[2022-04-08 14:56:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:59,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:59,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692268997]
[2022-04-08 14:56:59,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692268997] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:59,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:59,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:59,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:59,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [726124773]
[2022-04-08 14:56:59,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [726124773] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:59,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:59,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:59,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549116510]
[2022-04-08 14:56:59,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 14:56:59,817 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:59,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:59,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:59,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:59,830 INFO L87 Difference]: Start difference. First operand 1801 states and 2903 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:00,888 INFO L93 Difference]: Finished difference Result 4237 states and 6873 transitions.
[2022-04-08 14:57:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:00,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 14:57:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions.
[2022-04-08 14:57:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions.
[2022-04-08 14:57:00,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 231 transitions.
[2022-04-08 14:57:01,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:01,269 INFO L225 Difference]: With dead ends: 4237
[2022-04-08 14:57:01,269 INFO L226 Difference]: Without dead ends: 2475
[2022-04-08 14:57:01,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:57:01,272 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:01,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 129 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states.
[2022-04-08 14:57:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473.
[2022-04-08 14:57:01,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:01,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:01,452 INFO L74 IsIncluded]: Start isIncluded. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:01,453 INFO L87 Difference]: Start difference. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:01,596 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions.
[2022-04-08 14:57:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions.
[2022-04-08 14:57:01,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:01,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:01,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2475 states.
[2022-04-08 14:57:01,603 INFO L87 Difference]: Start difference. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2475 states.
[2022-04-08 14:57:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:01,749 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions.
[2022-04-08 14:57:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions.
[2022-04-08 14:57:01,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:01,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:01,752 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:57:01,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:57:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3975 transitions.
[2022-04-08 14:57:02,031 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3975 transitions. Word has length 29
[2022-04-08 14:57:02,031 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:57:02,031 INFO L478 AbstractCegarLoop]: Abstraction has 2473 states and 3975 transitions.
[2022-04-08 14:57:02,032 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:02,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2473 states and 3975 transitions.
[2022-04-08 14:57:05,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3975 transitions.
[2022-04-08 14:57:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 14:57:05,613 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:57:05,613 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:57:05,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-04-08 14:57:05,614 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:57:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:57:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 1 times
[2022-04-08 14:57:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [336706183]
[2022-04-08 14:57:05,614 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:57:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 2 times
[2022-04-08 14:57:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:57:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011337614]
[2022-04-08 14:57:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:57:05,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:57:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:05,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:57:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:05,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {79649#true} is VALID
[2022-04-08 14:57:05,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {79649#true} assume true; {79649#true} is VALID
[2022-04-08 14:57:05,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {79649#true} call ULTIMATE.init(); {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:57:05,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {79649#true} assume true; {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {79649#true} call #t~ret18 := main(); {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {79649#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {79649#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {79649#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {79649#true} assume !(0 != ~p1~0); {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {79649#true} assume !(0 != ~p2~0); {79649#true} is VALID
[2022-04-08 14:57:05,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {79649#true} assume !(0 != ~p3~0); {79649#true} is VALID
[2022-04-08 14:57:05,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {79649#true} assume !(0 != ~p4~0); {79649#true} is VALID
[2022-04-08 14:57:05,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {79649#true} assume !(0 != ~p5~0); {79649#true} is VALID
[2022-04-08 14:57:05,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {79649#true} assume 0 != ~p6~0;~lk6~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {79654#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:57:05,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {79650#false} is VALID
[2022-04-08 14:57:05,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {79650#false} assume 0 != ~p7~0; {79650#false} is VALID
[2022-04-08 14:57:05,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {79650#false} assume 1 != ~lk7~0; {79650#false} is VALID
[2022-04-08 14:57:05,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {79650#false} assume !false; {79650#false} is VALID
[2022-04-08 14:57:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:57:05,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:57:05,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011337614]
[2022-04-08 14:57:05,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011337614] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:05,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:05,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:05,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:57:05,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [336706183]
[2022-04-08 14:57:05,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [336706183] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:05,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:05,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816704111]
[2022-04-08 14:57:05,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:57:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 14:57:05,673 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:57:05,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:05,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:05,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:57:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:05,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:57:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:57:05,694 INFO L87 Difference]: Start difference. First operand 2473 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:06,593 INFO L93 Difference]: Finished difference Result 3709 states and 5945 transitions.
[2022-04-08 14:57:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:06,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 14:57:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions.
[2022-04-08 14:57:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions.
[2022-04-08 14:57:06,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions.
[2022-04-08 14:57:06,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:06,974 INFO L225 Difference]: With dead ends: 3709
[2022-04-08 14:57:06,974 INFO L226 Difference]: Without dead ends: 2507
[2022-04-08 14:57:06,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:57:06,976 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:06,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 128 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states.
[2022-04-08 14:57:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505.
[2022-04-08 14:57:07,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:07,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:07,135 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:07,136 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:07,284 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions.
[2022-04-08 14:57:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions.
[2022-04-08 14:57:07,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:07,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:07,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states.
[2022-04-08 14:57:07,291 INFO L87 Difference]: Start difference. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states.
[2022-04-08 14:57:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:07,442 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions.
[2022-04-08 14:57:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions.
[2022-04-08 14:57:07,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:07,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:07,461 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:57:07,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:57:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3975 transitions.
[2022-04-08 14:57:07,713 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3975 transitions. Word has length 30
[2022-04-08 14:57:07,713 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:57:07,713 INFO L478 AbstractCegarLoop]: Abstraction has 2505 states and 3975 transitions.
[2022-04-08 14:57:07,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:07,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2505 states and 3975 transitions.
[2022-04-08 14:57:11,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3975 transitions.
[2022-04-08 14:57:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 14:57:11,259 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:57:11,259 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:57:11,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-04-08 14:57:11,259 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:57:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:57:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 1 times
[2022-04-08 14:57:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:11,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890006404]
[2022-04-08 14:57:11,260 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:57:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 2 times
[2022-04-08 14:57:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:57:11,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770400401]
[2022-04-08 14:57:11,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:57:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:57:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:57:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:11,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {97103#true} is VALID
[2022-04-08 14:57:11,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {97103#true} assume true; {97103#true} is VALID
[2022-04-08 14:57:11,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID
[2022-04-08 14:57:11,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {97103#true} call ULTIMATE.init(); {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:57:11,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {97103#true} is VALID
[2022-04-08 14:57:11,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {97103#true} assume true; {97103#true} is VALID
[2022-04-08 14:57:11,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID
[2022-04-08 14:57:11,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {97103#true} call #t~ret18 := main(); {97103#true} is VALID
[2022-04-08 14:57:11,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {97103#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {97103#true} is VALID
[2022-04-08 14:57:11,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {97103#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {97103#true} is VALID
[2022-04-08 14:57:11,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {97103#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {97103#true} is VALID
[2022-04-08 14:57:11,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {97103#true} assume !(0 != ~p1~0); {97103#true} is VALID
[2022-04-08 14:57:11,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {97103#true} assume !(0 != ~p2~0); {97103#true} is VALID
[2022-04-08 14:57:11,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {97103#true} assume !(0 != ~p3~0); {97103#true} is VALID
[2022-04-08 14:57:11,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {97103#true} assume !(0 != ~p4~0); {97103#true} is VALID
[2022-04-08 14:57:11,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {97103#true} assume !(0 != ~p5~0); {97103#true} is VALID
[2022-04-08 14:57:11,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {97103#true} assume !(0 != ~p6~0); {97103#true} is VALID
[2022-04-08 14:57:11,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {97103#true} assume 0 != ~p7~0;~lk7~0 := 1; {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p7~0; {97108#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:57:11,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {97108#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {97104#false} is VALID
[2022-04-08 14:57:11,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {97104#false} assume !false; {97104#false} is VALID
[2022-04-08 14:57:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:57:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:57:11,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770400401]
[2022-04-08 14:57:11,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770400401] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:11,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:11,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:11,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:57:11,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890006404]
[2022-04-08 14:57:11,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890006404] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:11,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:11,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693081035]
[2022-04-08 14:57:11,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:57:11,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 14:57:11,319 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:57:11,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:11,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:11,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:57:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:11,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:57:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:57:11,336 INFO L87 Difference]: Start difference. First operand 2505 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:12,604 INFO L93 Difference]: Finished difference Result 4493 states and 7273 transitions.
[2022-04-08 14:57:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:12,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 14:57:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions.
[2022-04-08 14:57:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions.
[2022-04-08 14:57:12,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions.
[2022-04-08 14:57:12,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:13,521 INFO L225 Difference]: With dead ends: 4493
[2022-04-08 14:57:13,521 INFO L226 Difference]: Without dead ends: 4491
[2022-04-08 14:57:13,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:57:13,523 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:13,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 90 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states.
[2022-04-08 14:57:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3593.
[2022-04-08 14:57:13,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:13,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:13,773 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:13,775 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:14,266 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions.
[2022-04-08 14:57:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions.
[2022-04-08 14:57:14,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:14,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:14,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states.
[2022-04-08 14:57:14,277 INFO L87 Difference]: Start difference. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states.
[2022-04-08 14:57:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:14,782 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions.
[2022-04-08 14:57:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions.
[2022-04-08 14:57:14,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:14,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:14,786 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:57:14,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:57:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5543 transitions.
[2022-04-08 14:57:15,356 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5543 transitions. Word has length 30
[2022-04-08 14:57:15,356 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:57:15,356 INFO L478 AbstractCegarLoop]: Abstraction has 3593 states and 5543 transitions.
[2022-04-08 14:57:15,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:15,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3593 states and 5543 transitions.
[2022-04-08 14:57:20,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5543 edges. 5543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5543 transitions.
[2022-04-08 14:57:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 14:57:20,948 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:57:20,948 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:57:20,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-04-08 14:57:20,948 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:57:20,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:57:20,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 1 times
[2022-04-08 14:57:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:20,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [45891756]
[2022-04-08 14:57:20,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:57:20,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 2 times
[2022-04-08 14:57:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:57:20,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799649837]
[2022-04-08 14:57:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:57:20,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:57:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:21,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:57:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:21,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {122269#true} is VALID
[2022-04-08 14:57:21,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {122269#true} assume true; {122269#true} is VALID
[2022-04-08 14:57:21,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {122269#true} call ULTIMATE.init(); {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {122269#true} assume true; {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {122269#true} call #t~ret18 := main(); {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {122269#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {122269#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {122269#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {122269#true} assume !(0 != ~p1~0); {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {122269#true} assume !(0 != ~p2~0); {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {122269#true} assume !(0 != ~p3~0); {122269#true} is VALID
[2022-04-08 14:57:21,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {122269#true} assume !(0 != ~p4~0); {122269#true} is VALID
[2022-04-08 14:57:21,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {122269#true} assume !(0 != ~p5~0); {122269#true} is VALID
[2022-04-08 14:57:21,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {122269#true} assume !(0 != ~p6~0); {122269#true} is VALID
[2022-04-08 14:57:21,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {122269#true} assume !(0 != ~p7~0); {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p10~0); {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p1~0); {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p2~0); {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p3~0); {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p4~0); {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p5~0); {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p6~0); {122274#(= main_~p7~0 0)} is VALID
[2022-04-08 14:57:21,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p7~0; {122270#false} is VALID
[2022-04-08 14:57:21,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {122270#false} assume 1 != ~lk7~0; {122270#false} is VALID
[2022-04-08 14:57:21,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {122270#false} assume !false; {122270#false} is VALID
[2022-04-08 14:57:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:57:21,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:57:21,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799649837]
[2022-04-08 14:57:21,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799649837] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:21,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:21,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:21,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:57:21,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [45891756]
[2022-04-08 14:57:21,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [45891756] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:21,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:21,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:21,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401502690]
[2022-04-08 14:57:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:57:21,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 14:57:21,012 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:57:21,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:21,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:21,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:57:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:21,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:57:21,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:57:21,028 INFO L87 Difference]: Start difference. First operand 3593 states and 5543 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:24,516 INFO L93 Difference]: Finished difference Result 8397 states and 13033 transitions.
[2022-04-08 14:57:24,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:24,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 14:57:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions.
[2022-04-08 14:57:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions.
[2022-04-08 14:57:24,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions.
[2022-04-08 14:57:24,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:25,620 INFO L225 Difference]: With dead ends: 8397
[2022-04-08 14:57:25,621 INFO L226 Difference]: Without dead ends: 4875
[2022-04-08 14:57:25,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:57:25,625 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:25,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states.
[2022-04-08 14:57:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4873.
[2022-04-08 14:57:25,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:25,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:25,998 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:26,002 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:26,569 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions.
[2022-04-08 14:57:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions.
[2022-04-08 14:57:26,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:26,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:26,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states.
[2022-04-08 14:57:26,583 INFO L87 Difference]: Start difference. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states.
[2022-04-08 14:57:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:27,176 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions.
[2022-04-08 14:57:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions.
[2022-04-08 14:57:27,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:27,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:27,180 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:57:27,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:57:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7495 transitions.
[2022-04-08 14:57:28,263 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7495 transitions. Word has length 30
[2022-04-08 14:57:28,264 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:57:28,264 INFO L478 AbstractCegarLoop]: Abstraction has 4873 states and 7495 transitions.
[2022-04-08 14:57:28,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:28,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4873 states and 7495 transitions.
[2022-04-08 14:57:35,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7495 transitions.
[2022-04-08 14:57:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 14:57:35,357 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:57:35,357 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:57:35,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-04-08 14:57:35,357 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:57:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:57:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 1 times
[2022-04-08 14:57:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:35,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675395386]
[2022-04-08 14:57:35,358 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:57:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 2 times
[2022-04-08 14:57:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:57:35,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224743563]
[2022-04-08 14:57:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:57:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:57:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:57:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:35,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {158571#true} is VALID
[2022-04-08 14:57:35,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {158571#true} assume true; {158571#true} is VALID
[2022-04-08 14:57:35,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID
[2022-04-08 14:57:35,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {158571#true} call ULTIMATE.init(); {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:57:35,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {158571#true} is VALID
[2022-04-08 14:57:35,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {158571#true} assume true; {158571#true} is VALID
[2022-04-08 14:57:35,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID
[2022-04-08 14:57:35,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {158571#true} call #t~ret18 := main(); {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {158571#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {158571#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {158571#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {158571#true} assume !(0 != ~p1~0); {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {158571#true} assume !(0 != ~p2~0); {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {158571#true} assume !(0 != ~p3~0); {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {158571#true} assume !(0 != ~p4~0); {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {158571#true} assume !(0 != ~p5~0); {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {158571#true} assume !(0 != ~p6~0); {158571#true} is VALID
[2022-04-08 14:57:35,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {158571#true} assume 0 != ~p7~0;~lk7~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {158576#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:35,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {158572#false} is VALID
[2022-04-08 14:57:35,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {158572#false} assume 0 != ~p8~0; {158572#false} is VALID
[2022-04-08 14:57:35,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {158572#false} assume 1 != ~lk8~0; {158572#false} is VALID
[2022-04-08 14:57:35,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {158572#false} assume !false; {158572#false} is VALID
[2022-04-08 14:57:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:57:35,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:57:35,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224743563]
[2022-04-08 14:57:35,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224743563] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:35,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:35,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:35,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:57:35,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675395386]
[2022-04-08 14:57:35,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675395386] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:35,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:35,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097067841]
[2022-04-08 14:57:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:57:35,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 14:57:35,403 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:57:35,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:35,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:35,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:57:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:57:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:57:35,414 INFO L87 Difference]: Start difference. First operand 4873 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:38,141 INFO L93 Difference]: Finished difference Result 7309 states and 11209 transitions.
[2022-04-08 14:57:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:38,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 14:57:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions.
[2022-04-08 14:57:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions.
[2022-04-08 14:57:38,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions.
[2022-04-08 14:57:38,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:39,225 INFO L225 Difference]: With dead ends: 7309
[2022-04-08 14:57:39,225 INFO L226 Difference]: Without dead ends: 4939
[2022-04-08 14:57:39,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:57:39,229 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:39,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 125 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states.
[2022-04-08 14:57:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4937.
[2022-04-08 14:57:39,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:39,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:39,602 INFO L74 IsIncluded]: Start isIncluded. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:39,607 INFO L87 Difference]: Start difference. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:40,205 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions.
[2022-04-08 14:57:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions.
[2022-04-08 14:57:40,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:40,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:40,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4939 states.
[2022-04-08 14:57:40,220 INFO L87 Difference]: Start difference. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4939 states.
[2022-04-08 14:57:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:40,835 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions.
[2022-04-08 14:57:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions.
[2022-04-08 14:57:40,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:40,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:40,838 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:57:40,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:57:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 7495 transitions.
[2022-04-08 14:57:41,898 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 7495 transitions. Word has length 31
[2022-04-08 14:57:41,899 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:57:41,899 INFO L478 AbstractCegarLoop]: Abstraction has 4937 states and 7495 transitions.
[2022-04-08 14:57:41,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:41,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4937 states and 7495 transitions.
[2022-04-08 14:57:49,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 7495 transitions.
[2022-04-08 14:57:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 14:57:49,018 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:57:49,018 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:57:49,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-04-08 14:57:49,018 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:57:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:57:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 1 times
[2022-04-08 14:57:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:49,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2106380740]
[2022-04-08 14:57:49,019 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:57:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 2 times
[2022-04-08 14:57:49,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:57:49,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638202480]
[2022-04-08 14:57:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:57:49,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:57:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:49,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:57:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:49,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {192953#true} is VALID
[2022-04-08 14:57:49,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {192953#true} assume true; {192953#true} is VALID
[2022-04-08 14:57:49,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID
[2022-04-08 14:57:49,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {192953#true} call ULTIMATE.init(); {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:57:49,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {192953#true} is VALID
[2022-04-08 14:57:49,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {192953#true} assume true; {192953#true} is VALID
[2022-04-08 14:57:49,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID
[2022-04-08 14:57:49,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {192953#true} call #t~ret18 := main(); {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {192953#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {192953#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {192953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {192953#true} assume !(0 != ~p1~0); {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {192953#true} assume !(0 != ~p2~0); {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {192953#true} assume !(0 != ~p3~0); {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {192953#true} assume !(0 != ~p4~0); {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {192953#true} assume !(0 != ~p5~0); {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {192953#true} assume !(0 != ~p6~0); {192953#true} is VALID
[2022-04-08 14:57:49,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {192953#true} assume !(0 != ~p7~0); {192953#true} is VALID
[2022-04-08 14:57:49,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {192953#true} assume 0 != ~p8~0;~lk8~0 := 1; {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p8~0; {192958#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:49,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {192958#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {192954#false} is VALID
[2022-04-08 14:57:49,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {192954#false} assume !false; {192954#false} is VALID
[2022-04-08 14:57:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:57:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:57:49,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638202480]
[2022-04-08 14:57:49,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638202480] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:49,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:49,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:49,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:57:49,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2106380740]
[2022-04-08 14:57:49,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2106380740] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:49,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:49,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514473007]
[2022-04-08 14:57:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:57:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 14:57:49,105 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:57:49,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:49,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:49,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:57:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:57:49,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:57:49,116 INFO L87 Difference]: Start difference. First operand 4937 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:53,055 INFO L93 Difference]: Finished difference Result 8717 states and 13513 transitions.
[2022-04-08 14:57:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:53,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 14:57:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions.
[2022-04-08 14:57:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions.
[2022-04-08 14:57:53,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions.
[2022-04-08 14:57:53,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:56,231 INFO L225 Difference]: With dead ends: 8717
[2022-04-08 14:57:56,231 INFO L226 Difference]: Without dead ends: 8715
[2022-04-08 14:57:56,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:57:56,233 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:56,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states.
[2022-04-08 14:57:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 7177.
[2022-04-08 14:57:56,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:56,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:56,780 INFO L74 IsIncluded]: Start isIncluded. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:56,786 INFO L87 Difference]: Start difference. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:57:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:58,573 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions.
[2022-04-08 14:57:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions.
[2022-04-08 14:57:58,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:58,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:58,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8715 states.
[2022-04-08 14:57:58,593 INFO L87 Difference]: Start difference. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8715 states.
[2022-04-08 14:58:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:00,388 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions.
[2022-04-08 14:58:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions.
[2022-04-08 14:58:00,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:58:00,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:58:00,394 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:58:00,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:58:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 10567 transitions.
[2022-04-08 14:58:02,728 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 10567 transitions. Word has length 31
[2022-04-08 14:58:02,728 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:58:02,729 INFO L478 AbstractCegarLoop]: Abstraction has 7177 states and 10567 transitions.
[2022-04-08 14:58:02,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:02,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7177 states and 10567 transitions.
[2022-04-08 14:58:13,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10567 edges. 10567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:58:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 10567 transitions.
[2022-04-08 14:58:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 14:58:13,403 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:58:13,403 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:58:13,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-04-08 14:58:13,404 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:58:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:58:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 1 times
[2022-04-08 14:58:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:58:13,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695469769]
[2022-04-08 14:58:13,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:58:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 2 times
[2022-04-08 14:58:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:58:13,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012171037]
[2022-04-08 14:58:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:58:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:58:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:58:13,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:58:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:58:13,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {242183#true} is VALID
[2022-04-08 14:58:13,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {242183#true} assume true; {242183#true} is VALID
[2022-04-08 14:58:13,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID
[2022-04-08 14:58:13,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {242183#true} call ULTIMATE.init(); {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:58:13,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {242183#true} is VALID
[2022-04-08 14:58:13,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {242183#true} assume true; {242183#true} is VALID
[2022-04-08 14:58:13,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID
[2022-04-08 14:58:13,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {242183#true} call #t~ret18 := main(); {242183#true} is VALID
[2022-04-08 14:58:13,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {242183#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {242183#true} is VALID
[2022-04-08 14:58:13,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {242183#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {242183#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {242183#true} assume !(0 != ~p1~0); {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {242183#true} assume !(0 != ~p2~0); {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {242183#true} assume !(0 != ~p3~0); {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {242183#true} assume !(0 != ~p4~0); {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {242183#true} assume !(0 != ~p5~0); {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {242183#true} assume !(0 != ~p6~0); {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {242183#true} assume !(0 != ~p7~0); {242183#true} is VALID
[2022-04-08 14:58:13,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {242183#true} assume !(0 != ~p8~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p10~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p1~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p2~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p3~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p4~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p5~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p6~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p7~0); {242188#(= main_~p8~0 0)} is VALID
[2022-04-08 14:58:13,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p8~0; {242184#false} is VALID
[2022-04-08 14:58:13,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {242184#false} assume 1 != ~lk8~0; {242184#false} is VALID
[2022-04-08 14:58:13,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {242184#false} assume !false; {242184#false} is VALID
[2022-04-08 14:58:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:58:13,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:58:13,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012171037]
[2022-04-08 14:58:13,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012171037] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:58:13,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:58:13,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:58:13,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:58:13,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695469769]
[2022-04-08 14:58:13,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695469769] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:58:13,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:58:13,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:58:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9775333]
[2022-04-08 14:58:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:58:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 14:58:13,440 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:58:13,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:13,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:58:13,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:58:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:58:13,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:58:13,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:58:13,459 INFO L87 Difference]: Start difference. First operand 7177 states and 10567 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:26,065 INFO L93 Difference]: Finished difference Result 16653 states and 24649 transitions.
[2022-04-08 14:58:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:58:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 14:58:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:58:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions.
[2022-04-08 14:58:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions.
[2022-04-08 14:58:26,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 225 transitions.
[2022-04-08 14:58:26,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:58:29,995 INFO L225 Difference]: With dead ends: 16653
[2022-04-08 14:58:29,996 INFO L226 Difference]: Without dead ends: 9611
[2022-04-08 14:58:30,003 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:58:30,004 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:58:30,004 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 133 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:58:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states.
[2022-04-08 14:58:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9609.
[2022-04-08 14:58:30,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:58:30,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:30,753 INFO L74 IsIncluded]: Start isIncluded. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:30,763 INFO L87 Difference]: Start difference. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:32,839 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions.
[2022-04-08 14:58:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions.
[2022-04-08 14:58:32,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:58:32,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:58:32,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9611 states.
[2022-04-08 14:58:32,863 INFO L87 Difference]: Start difference. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9611 states.
[2022-04-08 14:58:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:34,966 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions.
[2022-04-08 14:58:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions.
[2022-04-08 14:58:34,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:58:34,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:58:34,973 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:58:34,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:58:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 14087 transitions.
[2022-04-08 14:58:38,797 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 14087 transitions. Word has length 31
[2022-04-08 14:58:38,797 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:58:38,797 INFO L478 AbstractCegarLoop]: Abstraction has 9609 states and 14087 transitions.
[2022-04-08 14:58:38,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:38,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9609 states and 14087 transitions.
[2022-04-08 14:58:54,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:58:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 14087 transitions.
[2022-04-08 14:58:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 14:58:54,324 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:58:54,324 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:58:54,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-04-08 14:58:54,325 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:58:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:58:54,325 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 1 times
[2022-04-08 14:58:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:58:54,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [342405598]
[2022-04-08 14:58:54,325 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:58:54,325 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 2 times
[2022-04-08 14:58:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:58:54,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895089359]
[2022-04-08 14:58:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:58:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:58:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:58:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:58:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:58:54,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {313941#true} is VALID
[2022-04-08 14:58:54,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {313941#true} assume true; {313941#true} is VALID
[2022-04-08 14:58:54,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID
[2022-04-08 14:58:54,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {313941#true} call ULTIMATE.init(); {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {313941#true} assume true; {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {313941#true} call #t~ret18 := main(); {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {313941#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {313941#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {313941#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {313941#true} assume !(0 != ~p1~0); {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {313941#true} assume !(0 != ~p2~0); {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {313941#true} assume !(0 != ~p3~0); {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {313941#true} assume !(0 != ~p4~0); {313941#true} is VALID
[2022-04-08 14:58:54,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {313941#true} assume !(0 != ~p5~0); {313941#true} is VALID
[2022-04-08 14:58:54,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {313941#true} assume !(0 != ~p6~0); {313941#true} is VALID
[2022-04-08 14:58:54,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {313941#true} assume !(0 != ~p7~0); {313941#true} is VALID
[2022-04-08 14:58:54,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {313941#true} assume 0 != ~p8~0;~lk8~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {313946#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:54,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {313942#false} is VALID
[2022-04-08 14:58:54,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {313942#false} assume 0 != ~p9~0; {313942#false} is VALID
[2022-04-08 14:58:54,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {313942#false} assume 1 != ~lk9~0; {313942#false} is VALID
[2022-04-08 14:58:54,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {313942#false} assume !false; {313942#false} is VALID
[2022-04-08 14:58:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:58:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:58:54,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895089359]
[2022-04-08 14:58:54,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895089359] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:58:54,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:58:54,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:58:54,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:58:54,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [342405598]
[2022-04-08 14:58:54,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [342405598] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:58:54,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:58:54,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:58:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271361530]
[2022-04-08 14:58:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:58:54,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 14:58:54,360 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:58:54,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:58:54,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:58:54,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:58:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:58:54,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:58:54,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:58:54,380 INFO L87 Difference]: Start difference. First operand 9609 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:59:04,267 INFO L93 Difference]: Finished difference Result 14413 states and 21065 transitions.
[2022-04-08 14:59:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:59:04,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 14:59:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:59:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions.
[2022-04-08 14:59:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions.
[2022-04-08 14:59:04,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions.
[2022-04-08 14:59:04,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:59:08,246 INFO L225 Difference]: With dead ends: 14413
[2022-04-08 14:59:08,246 INFO L226 Difference]: Without dead ends: 9739
[2022-04-08 14:59:08,251 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:59:08,252 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:59:08,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 122 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:59:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states.
[2022-04-08 14:59:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 9737.
[2022-04-08 14:59:09,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:59:09,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:09,033 INFO L74 IsIncluded]: Start isIncluded. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:09,045 INFO L87 Difference]: Start difference. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:59:11,300 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions.
[2022-04-08 14:59:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions.
[2022-04-08 14:59:11,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:59:11,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:59:11,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9739 states.
[2022-04-08 14:59:11,331 INFO L87 Difference]: Start difference. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9739 states.
[2022-04-08 14:59:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:59:13,775 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions.
[2022-04-08 14:59:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions.
[2022-04-08 14:59:13,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:59:13,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:59:13,781 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:59:13,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:59:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 14087 transitions.
[2022-04-08 14:59:17,690 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 14087 transitions. Word has length 32
[2022-04-08 14:59:17,690 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:59:17,690 INFO L478 AbstractCegarLoop]: Abstraction has 9737 states and 14087 transitions.
[2022-04-08 14:59:17,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:17,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9737 states and 14087 transitions.
[2022-04-08 14:59:32,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:59:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 14087 transitions.
[2022-04-08 14:59:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 14:59:32,805 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:59:32,805 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:59:32,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-04-08 14:59:32,805 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:59:32,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:59:32,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 1 times
[2022-04-08 14:59:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:59:32,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347028625]
[2022-04-08 14:59:32,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:59:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 2 times
[2022-04-08 14:59:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:59:32,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081906579]
[2022-04-08 14:59:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:59:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:59:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:59:32,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:59:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:59:32,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {381731#true} is VALID
[2022-04-08 14:59:32,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {381731#true} assume true; {381731#true} is VALID
[2022-04-08 14:59:32,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID
[2022-04-08 14:59:32,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {381731#true} call ULTIMATE.init(); {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:59:32,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {381731#true} is VALID
[2022-04-08 14:59:32,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {381731#true} assume true; {381731#true} is VALID
[2022-04-08 14:59:32,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID
[2022-04-08 14:59:32,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {381731#true} call #t~ret18 := main(); {381731#true} is VALID
[2022-04-08 14:59:32,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {381731#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {381731#true} is VALID
[2022-04-08 14:59:32,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {381731#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {381731#true} is VALID
[2022-04-08 14:59:32,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {381731#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {381731#true} is VALID
[2022-04-08 14:59:32,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {381731#true} assume !(0 != ~p1~0); {381731#true} is VALID
[2022-04-08 14:59:32,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {381731#true} assume !(0 != ~p2~0); {381731#true} is VALID
[2022-04-08 14:59:32,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {381731#true} assume !(0 != ~p3~0); {381731#true} is VALID
[2022-04-08 14:59:32,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {381731#true} assume !(0 != ~p4~0); {381731#true} is VALID
[2022-04-08 14:59:32,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {381731#true} assume !(0 != ~p5~0); {381731#true} is VALID
[2022-04-08 14:59:32,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {381731#true} assume !(0 != ~p6~0); {381731#true} is VALID
[2022-04-08 14:59:32,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {381731#true} assume !(0 != ~p7~0); {381731#true} is VALID
[2022-04-08 14:59:32,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {381731#true} assume !(0 != ~p8~0); {381731#true} is VALID
[2022-04-08 14:59:32,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {381731#true} assume 0 != ~p9~0;~lk9~0 := 1; {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p9~0; {381736#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:59:32,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {381736#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {381732#false} is VALID
[2022-04-08 14:59:32,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {381732#false} assume !false; {381732#false} is VALID
[2022-04-08 14:59:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:59:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:59:32,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081906579]
[2022-04-08 14:59:32,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081906579] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:59:32,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:59:32,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:59:32,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:59:32,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1347028625]
[2022-04-08 14:59:32,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1347028625] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:59:32,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:59:32,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:59:32,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064791626]
[2022-04-08 14:59:32,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:59:32,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 14:59:32,890 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:59:32,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:32,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:59:32,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:59:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:59:32,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:59:32,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:59:32,905 INFO L87 Difference]: Start difference. First operand 9737 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:59:46,743 INFO L93 Difference]: Finished difference Result 16909 states and 24969 transitions.
[2022-04-08 14:59:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:59:46,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 14:59:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:59:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions.
[2022-04-08 14:59:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions.
[2022-04-08 14:59:46,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions.
[2022-04-08 14:59:46,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:59:58,701 INFO L225 Difference]: With dead ends: 16909
[2022-04-08 14:59:58,701 INFO L226 Difference]: Without dead ends: 16907
[2022-04-08 14:59:58,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:59:58,706 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:59:58,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:59:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states.
[2022-04-08 14:59:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 14345.
[2022-04-08 14:59:59,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:59:59,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:59,925 INFO L74 IsIncluded]: Start isIncluded. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:59:59,941 INFO L87 Difference]: Start difference. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:00:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:00:07,465 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions.
[2022-04-08 15:00:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions.
[2022-04-08 15:00:07,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:00:07,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:00:07,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16907 states.
[2022-04-08 15:00:07,510 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16907 states.
[2022-04-08 15:00:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:00:14,873 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions.
[2022-04-08 15:00:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions.
[2022-04-08 15:00:14,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:00:14,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:00:14,885 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 15:00:14,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 15:00:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:00:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 20103 transitions.
[2022-04-08 15:00:25,966 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 20103 transitions. Word has length 32
[2022-04-08 15:00:25,966 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 15:00:25,966 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 20103 transitions.
[2022-04-08 15:00:25,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:00:25,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 20103 transitions.
[2022-04-08 15:00:47,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20103 edges. 20103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:00:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 20103 transitions.
[2022-04-08 15:00:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 15:00:47,620 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 15:00:47,620 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 15:00:47,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2022-04-08 15:00:47,621 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 15:00:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 15:00:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 1 times
[2022-04-08 15:00:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:00:47,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [628166630]
[2022-04-08 15:00:47,621 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 15:00:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 2 times
[2022-04-08 15:00:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 15:00:47,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169587855]
[2022-04-08 15:00:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 15:00:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 15:00:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:00:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 15:00:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:00:47,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {478065#true} is VALID
[2022-04-08 15:00:47,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {478065#true} assume true; {478065#true} is VALID
[2022-04-08 15:00:47,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID
[2022-04-08 15:00:47,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {478065#true} call ULTIMATE.init(); {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 15:00:47,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {478065#true} is VALID
[2022-04-08 15:00:47,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {478065#true} assume true; {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {478065#true} call #t~ret18 := main(); {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {478065#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {478065#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {478065#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {478065#true} assume !(0 != ~p1~0); {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {478065#true} assume !(0 != ~p2~0); {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {478065#true} assume !(0 != ~p3~0); {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {478065#true} assume !(0 != ~p4~0); {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {478065#true} assume !(0 != ~p5~0); {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {478065#true} assume !(0 != ~p6~0); {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {478065#true} assume !(0 != ~p7~0); {478065#true} is VALID
[2022-04-08 15:00:47,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {478065#true} assume !(0 != ~p8~0); {478065#true} is VALID
[2022-04-08 15:00:47,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {478065#true} assume !(0 != ~p9~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p10~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p1~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p2~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p3~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p4~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p5~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p6~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p7~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p8~0); {478070#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:47,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p9~0; {478066#false} is VALID
[2022-04-08 15:00:47,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {478066#false} assume 1 != ~lk9~0; {478066#false} is VALID
[2022-04-08 15:00:47,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {478066#false} assume !false; {478066#false} is VALID
[2022-04-08 15:00:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 15:00:47,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 15:00:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169587855]
[2022-04-08 15:00:47,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169587855] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:00:47,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:00:47,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:00:47,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 15:00:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [628166630]
[2022-04-08 15:00:47,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [628166630] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:00:47,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:00:47,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:00:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775200266]
[2022-04-08 15:00:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 15:00:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 15:00:47,655 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 15:00:47,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:00:47,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:00:47,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 15:00:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:00:47,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 15:00:47,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 15:00:47,673 INFO L87 Difference]: Start difference. First operand 14345 states and 20103 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:01:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:01:51,264 INFO L93 Difference]: Finished difference Result 33037 states and 46473 transitions.
[2022-04-08 15:01:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 15:01:51,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 15:01:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 15:01:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:01:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions.
[2022-04-08 15:01:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:01:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions.
[2022-04-08 15:01:51,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions.
[2022-04-08 15:01:51,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:02:06,548 INFO L225 Difference]: With dead ends: 33037
[2022-04-08 15:02:06,549 INFO L226 Difference]: Without dead ends: 18955
[2022-04-08 15:02:06,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 15:02:06,564 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 15:02:06,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 135 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 15:02:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states.
[2022-04-08 15:02:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 18953.
[2022-04-08 15:02:08,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 15:02:08,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:02:08,144 INFO L74 IsIncluded]: Start isIncluded. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:02:08,165 INFO L87 Difference]: Start difference. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:02:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:02:16,902 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions.
[2022-04-08 15:02:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions.
[2022-04-08 15:02:16,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:02:16,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:02:16,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18955 states.
[2022-04-08 15:02:16,960 INFO L87 Difference]: Start difference. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18955 states.
[2022-04-08 15:02:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:02:25,462 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions.
[2022-04-08 15:02:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions.
[2022-04-08 15:02:25,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:02:25,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:02:25,475 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 15:02:25,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 15:02:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:02:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18953 states to 18953 states and 26375 transitions.
[2022-04-08 15:02:41,156 INFO L78 Accepts]: Start accepts. Automaton has 18953 states and 26375 transitions. Word has length 32
[2022-04-08 15:02:41,157 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 15:02:41,157 INFO L478 AbstractCegarLoop]: Abstraction has 18953 states and 26375 transitions.
[2022-04-08 15:02:41,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:02:41,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18953 states and 26375 transitions.
[2022-04-08 15:03:09,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:03:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 18953 states and 26375 transitions.
[2022-04-08 15:03:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-08 15:03:09,069 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 15:03:09,069 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 15:03:09,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2022-04-08 15:03:09,069 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 15:03:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 15:03:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 1 times
[2022-04-08 15:03:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:03:09,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449415902]
[2022-04-08 15:03:09,070 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 15:03:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 2 times
[2022-04-08 15:03:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 15:03:09,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512087701]
[2022-04-08 15:03:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 15:03:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 15:03:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:03:09,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 15:03:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:03:09,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {619967#true} is VALID
[2022-04-08 15:03:09,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {619967#true} assume true; {619967#true} is VALID
[2022-04-08 15:03:09,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID
[2022-04-08 15:03:09,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {619967#true} call ULTIMATE.init(); {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 15:03:09,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {619967#true} is VALID
[2022-04-08 15:03:09,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {619967#true} assume true; {619967#true} is VALID
[2022-04-08 15:03:09,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID
[2022-04-08 15:03:09,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {619967#true} call #t~ret18 := main(); {619967#true} is VALID
[2022-04-08 15:03:09,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {619967#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {619967#true} is VALID
[2022-04-08 15:03:09,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {619967#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {619967#true} is VALID
[2022-04-08 15:03:09,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {619967#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {619967#true} assume !(0 != ~p1~0); {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {619967#true} assume !(0 != ~p2~0); {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {619967#true} assume !(0 != ~p3~0); {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {619967#true} assume !(0 != ~p4~0); {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {619967#true} assume !(0 != ~p5~0); {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {619967#true} assume !(0 != ~p6~0); {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {619967#true} assume !(0 != ~p7~0); {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {619967#true} assume !(0 != ~p8~0); {619967#true} is VALID
[2022-04-08 15:03:09,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {619967#true} assume 0 != ~p9~0;~lk9~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {619972#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {619968#false} is VALID
[2022-04-08 15:03:09,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {619968#false} assume 0 != ~p10~0; {619968#false} is VALID
[2022-04-08 15:03:09,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {619968#false} assume 1 != ~lk10~0; {619968#false} is VALID
[2022-04-08 15:03:09,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {619968#false} assume !false; {619968#false} is VALID
[2022-04-08 15:03:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 15:03:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 15:03:09,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512087701]
[2022-04-08 15:03:09,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512087701] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:03:09,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:03:09,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:03:09,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 15:03:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449415902]
[2022-04-08 15:03:09,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449415902] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:03:09,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:03:09,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:03:09,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452693684]
[2022-04-08 15:03:09,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 15:03:09,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 15:03:09,125 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 15:03:09,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:03:09,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:03:09,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 15:03:09,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:03:09,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 15:03:09,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 15:03:09,144 INFO L87 Difference]: Start difference. First operand 18953 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:04:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:04:00,331 INFO L93 Difference]: Finished difference Result 28429 states and 39433 transitions.
[2022-04-08 15:04:00,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 15:04:00,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 15:04:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 15:04:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:04:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions.
[2022-04-08 15:04:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:04:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions.
[2022-04-08 15:04:00,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions.
[2022-04-08 15:04:00,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:04:16,061 INFO L225 Difference]: With dead ends: 28429
[2022-04-08 15:04:16,061 INFO L226 Difference]: Without dead ends: 19211
[2022-04-08 15:04:16,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 15:04:16,073 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 15:04:16,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 15:04:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states.
[2022-04-08 15:04:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19209.
[2022-04-08 15:04:17,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 15:04:17,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:04:17,752 INFO L74 IsIncluded]: Start isIncluded. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:04:17,772 INFO L87 Difference]: Start difference. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:04:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:04:26,408 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions.
[2022-04-08 15:04:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions.
[2022-04-08 15:04:26,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:04:26,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:04:26,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19211 states.
[2022-04-08 15:04:26,465 INFO L87 Difference]: Start difference. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19211 states.
[2022-04-08 15:04:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:04:35,570 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions.
[2022-04-08 15:04:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions.
[2022-04-08 15:04:35,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:04:35,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:04:35,583 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 15:04:35,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 15:04:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:04:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 26375 transitions.
[2022-04-08 15:04:51,434 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 26375 transitions. Word has length 33
[2022-04-08 15:04:51,434 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 15:04:51,434 INFO L478 AbstractCegarLoop]: Abstraction has 19209 states and 26375 transitions.
[2022-04-08 15:04:51,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:04:51,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19209 states and 26375 transitions.
[2022-04-08 15:05:18,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:05:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 26375 transitions.
[2022-04-08 15:05:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-08 15:05:18,699 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 15:05:18,699 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 15:05:18,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2022-04-08 15:05:18,700 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 15:05:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 15:05:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 1 times
[2022-04-08 15:05:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:05:18,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057612493]
[2022-04-08 15:05:18,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 15:05:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 2 times
[2022-04-08 15:05:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 15:05:18,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263681930]
[2022-04-08 15:05:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 15:05:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 15:05:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:05:18,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 15:05:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:05:18,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {753677#true} is VALID
[2022-04-08 15:05:18,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {753677#true} assume true; {753677#true} is VALID
[2022-04-08 15:05:18,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID
[2022-04-08 15:05:18,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {753677#true} call ULTIMATE.init(); {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 15:05:18,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {753677#true} is VALID
[2022-04-08 15:05:18,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {753677#true} assume true; {753677#true} is VALID
[2022-04-08 15:05:18,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID
[2022-04-08 15:05:18,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {753677#true} call #t~ret18 := main(); {753677#true} is VALID
[2022-04-08 15:05:18,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {753677#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {753677#true} is VALID
[2022-04-08 15:05:18,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {753677#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {753677#true} is VALID
[2022-04-08 15:05:18,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {753677#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {753677#true} assume !(0 != ~p1~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {753677#true} assume !(0 != ~p2~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {753677#true} assume !(0 != ~p3~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {753677#true} assume !(0 != ~p4~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {753677#true} assume !(0 != ~p5~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {753677#true} assume !(0 != ~p6~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {753677#true} assume !(0 != ~p7~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {753677#true} assume !(0 != ~p8~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {753677#true} assume !(0 != ~p9~0); {753677#true} is VALID
[2022-04-08 15:05:18,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {753677#true} assume !(0 != ~p10~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p1~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p2~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p3~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p4~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p5~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p6~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p7~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p8~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p9~0); {753682#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:18,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p10~0; {753678#false} is VALID
[2022-04-08 15:05:18,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {753678#false} assume 1 != ~lk10~0; {753678#false} is VALID
[2022-04-08 15:05:18,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {753678#false} assume !false; {753678#false} is VALID
[2022-04-08 15:05:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 15:05:18,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 15:05:18,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263681930]
[2022-04-08 15:05:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263681930] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:05:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:05:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:05:18,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 15:05:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057612493]
[2022-04-08 15:05:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057612493] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:05:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:05:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:05:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450020538]
[2022-04-08 15:05:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 15:05:18,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 15:05:18,744 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 15:05:18,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 15:05:18,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:05:18,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 15:05:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:05:18,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 15:05:18,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 15:05:18,761 INFO L87 Difference]: Start difference. First operand 19209 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)