/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_12.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 14:56:00,551 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 14:56:00,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 14:56:00,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 14:56:00,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 14:56:00,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 14:56:00,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 14:56:00,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 14:56:00,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 14:56:00,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 14:56:00,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 14:56:00,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 14:56:00,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 14:56:00,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 14:56:00,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 14:56:00,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 14:56:00,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 14:56:00,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 14:56:00,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 14:56:00,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 14:56:00,602 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 14:56:00,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 14:56:00,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 14:56:00,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 14:56:00,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 14:56:00,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 14:56:00,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 14:56:00,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 14:56:00,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 14:56:00,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 14:56:00,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 14:56:00,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 14:56:00,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 14:56:00,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 14:56:00,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 14:56:00,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 14:56:00,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 14:56:00,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 14:56:00,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 14:56:00,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 14:56:00,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 14:56:00,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 14:56:00,633 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:00,646 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 14:56:00,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 14:56:00,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 14:56:00,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 14:56:00,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 14:56:00,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 14:56:00,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 14:56:00,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 14:56:00,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 14:56:00,648 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 14:56:00,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 14:56:00,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 14:56:00,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 14:56:00,648 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 14:56:00,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 14:56:00,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 14:56:00,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 14:56:00,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 14:56:00,649 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 14:56:00,649 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 14:56:00,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 14:56:00,649 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-08 14:56:00,649 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:00,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 14:56:00,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 14:56:00,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 14:56:00,887 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 14:56:00,888 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 14:56:00,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c
[2022-04-08 14:56:00,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c27cf89/2f4baa4b15bc448b85fb5bc60c0be56c/FLAGf45ba3b5d
[2022-04-08 14:56:01,289 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 14:56:01,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c
[2022-04-08 14:56:01,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c27cf89/2f4baa4b15bc448b85fb5bc60c0be56c/FLAGf45ba3b5d
[2022-04-08 14:56:01,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c27cf89/2f4baa4b15bc448b85fb5bc60c0be56c
[2022-04-08 14:56:01,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 14:56:01,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 14:56:01,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 14:56:01,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 14:56:01,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 14:56:01,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:01" (1/1) ...
[2022-04-08 14:56:01,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1821b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:01, skipping insertion in model container
[2022-04-08 14:56:01,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:01" (1/1) ...
[2022-04-08 14:56:01,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 14:56:01,746 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 14:56:01,938 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_12.c[4591,4604]
[2022-04-08 14:56:01,941 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 14:56:01,959 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 14:56:01,999 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_12.c[4591,4604]
[2022-04-08 14:56:02,001 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 14:56:02,013 INFO L208 MainTranslator]: Completed translation
[2022-04-08 14:56:02,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:02 WrapperNode
[2022-04-08 14:56:02,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 14:56:02,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 14:56:02,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 14:56:02,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 14:56:02,024 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:02" (1/1) ...
[2022-04-08 14:56:02,024 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:02" (1/1) ...
[2022-04-08 14:56:02,040 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:02" (1/1) ...
[2022-04-08 14:56:02,041 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:02" (1/1) ...
[2022-04-08 14:56:02,052 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:02" (1/1) ...
[2022-04-08 14:56:02,064 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:02" (1/1) ...
[2022-04-08 14:56:02,065 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:02" (1/1) ...
[2022-04-08 14:56:02,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 14:56:02,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 14:56:02,068 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 14:56:02,068 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 14:56:02,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:02" (1/1) ...
[2022-04-08 14:56:02,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 14:56:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 14:56:02,105 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:02,112 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:02,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 14:56:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 14:56:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 14:56:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 14:56:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 14:56:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 14:56:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 14:56:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 14:56:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 14:56:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 14:56:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 14:56:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 14:56:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 14:56:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 14:56:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 14:56:02,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 14:56:02,197 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 14:56:02,199 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 14:56:02,474 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 14:56:02,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 14:56:02,481 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 14:56:02,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:02 BoogieIcfgContainer
[2022-04-08 14:56:02,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 14:56:02,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 14:56:02,484 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 14:56:02,491 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 14:56:02,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:56:01" (1/3) ...
[2022-04-08 14:56:02,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f0950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:02, skipping insertion in model container
[2022-04-08 14:56:02,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:02" (2/3) ...
[2022-04-08 14:56:02,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f0950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:02, skipping insertion in model container
[2022-04-08 14:56:02,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:02" (3/3) ...
[2022-04-08 14:56:02,494 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c
[2022-04-08 14:56:02,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 14:56:02,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 14:56:02,538 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 14:56:02,543 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:02,544 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 14:56:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-08 14:56:02,578 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:02,579 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:02,579 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 1 times
[2022-04-08 14:56:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:02,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417626286]
[2022-04-08 14:56:02,601 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 2 times
[2022-04-08 14:56:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:02,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309928952]
[2022-04-08 14:56:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:02,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:02,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {54#true} is VALID
[2022-04-08 14:56:02,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID
[2022-04-08 14:56:02,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID
[2022-04-08 14:56:02,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:02,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {54#true} is VALID
[2022-04-08 14:56:02,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID
[2022-04-08 14:56:02,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID
[2022-04-08 14:56:02,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret17 := main(); {54#true} is VALID
[2022-04-08 14:56:02,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#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;havoc ~cond~0; {54#true} is VALID
[2022-04-08 14:56:02,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {54#true} is VALID
[2022-04-08 14:56:02,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#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; {54#true} is VALID
[2022-04-08 14:56:02,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#true} assume 0 != ~p1~0;~lk1~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p1~0; {59#(= main_~lk1~0 1)} is VALID
[2022-04-08 14:56:02,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {55#false} is VALID
[2022-04-08 14:56:02,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} assume !false; {55#false} is VALID
[2022-04-08 14:56:02,918 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:02,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:02,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309928952]
[2022-04-08 14:56:02,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309928952] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:02,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:02,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:02,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417626286]
[2022-04-08 14:56:02,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417626286] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:02,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:02,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852206812]
[2022-04-08 14:56:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:02,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 14:56:02,930 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:02,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:02,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:02,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:02,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:02,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:02,980 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:03,400 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions.
[2022-04-08 14:56:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:03,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 14:56:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions.
[2022-04-08 14:56:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions.
[2022-04-08 14:56:03,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions.
[2022-04-08 14:56:03,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:03,604 INFO L225 Difference]: With dead ends: 100
[2022-04-08 14:56:03,604 INFO L226 Difference]: Without dead ends: 85
[2022-04-08 14:56:03,607 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:03,612 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 208 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:03,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2022-04-08 14:56:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59.
[2022-04-08 14:56:03,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:03,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have 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:03,660 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have 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:03,663 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have 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:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:03,674 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions.
[2022-04-08 14:56:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions.
[2022-04-08 14:56:03,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:03,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:03,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states.
[2022-04-08 14:56:03,676 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states.
[2022-04-08 14:56:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:03,681 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions.
[2022-04-08 14:56:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions.
[2022-04-08 14:56:03,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:03,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:03,682 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:03,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have 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:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions.
[2022-04-08 14:56:03,694 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23
[2022-04-08 14:56:03,694 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:03,694 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions.
[2022-04-08 14:56:03,695 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:03,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 106 transitions.
[2022-04-08 14:56:03,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions.
[2022-04-08 14:56:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-08 14:56:03,797 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:03,797 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:03,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 14:56:03,797 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:03,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 1 times
[2022-04-08 14:56:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:03,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367102418]
[2022-04-08 14:56:03,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 2 times
[2022-04-08 14:56:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:03,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63195584]
[2022-04-08 14:56:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:03,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:03,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {554#true} is VALID
[2022-04-08 14:56:03,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} assume true; {554#true} is VALID
[2022-04-08 14:56:03,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID
[2022-04-08 14:56:03,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:03,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {554#true} is VALID
[2022-04-08 14:56:03,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID
[2022-04-08 14:56:03,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID
[2022-04-08 14:56:03,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret17 := main(); {554#true} is VALID
[2022-04-08 14:56:03,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#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;havoc ~cond~0; {554#true} is VALID
[2022-04-08 14:56:03,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {554#true} is VALID
[2022-04-08 14:56:03,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#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; {554#true} is VALID
[2022-04-08 14:56:03,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 != ~p1~0); {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {559#(= main_~p1~0 0)} assume !(0 != ~p2~0); {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#(= main_~p1~0 0)} assume !(0 != ~p10~0); {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {559#(= main_~p1~0 0)} is VALID
[2022-04-08 14:56:03,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p1~0; {555#false} is VALID
[2022-04-08 14:56:03,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#false} assume 1 != ~lk1~0; {555#false} is VALID
[2022-04-08 14:56:03,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID
[2022-04-08 14:56:03,872 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:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:03,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63195584]
[2022-04-08 14:56:03,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63195584] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:03,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:03,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:03,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:03,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367102418]
[2022-04-08 14:56:03,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367102418] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:03,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:03,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222813921]
[2022-04-08 14:56:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:03,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 14:56:03,875 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:03,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:03,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:03,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:03,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:03,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:03,895 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:04,119 INFO L93 Difference]: Finished difference Result 138 states and 253 transitions.
[2022-04-08 14:56:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 14:56:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions.
[2022-04-08 14:56:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions.
[2022-04-08 14:56:04,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions.
[2022-04-08 14:56:04,304 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:56:04,307 INFO L225 Difference]: With dead ends: 138
[2022-04-08 14:56:04,307 INFO L226 Difference]: Without dead ends: 85
[2022-04-08 14:56:04,307 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:04,309 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 111 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.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:04,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2022-04-08 14:56:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83.
[2022-04-08 14:56:04,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:04,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have 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:04,325 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have 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:04,325 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have 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:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:04,328 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions.
[2022-04-08 14:56:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions.
[2022-04-08 14:56:04,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:04,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:04,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states.
[2022-04-08 14:56:04,330 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states.
[2022-04-08 14:56:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:04,341 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions.
[2022-04-08 14:56:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions.
[2022-04-08 14:56:04,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:04,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:04,347 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:04,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have 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:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions.
[2022-04-08 14:56:04,352 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23
[2022-04-08 14:56:04,352 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:04,353 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions.
[2022-04-08 14:56:04,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 14:56:04,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 150 transitions.
[2022-04-08 14:56:04,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions.
[2022-04-08 14:56:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 14:56:04,499 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:04,499 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:04,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-08 14:56:04,500 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 1 times
[2022-04-08 14:56:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:04,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [621576610]
[2022-04-08 14:56:04,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 2 times
[2022-04-08 14:56:04,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:04,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943493609]
[2022-04-08 14:56:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:04,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:04,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1178#true} is VALID
[2022-04-08 14:56:04,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} assume true; {1178#true} is VALID
[2022-04-08 14:56:04,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID
[2022-04-08 14:56:04,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:04,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1178#true} is VALID
[2022-04-08 14:56:04,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID
[2022-04-08 14:56:04,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID
[2022-04-08 14:56:04,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret17 := main(); {1178#true} is VALID
[2022-04-08 14:56:04,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#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;havoc ~cond~0; {1178#true} is VALID
[2022-04-08 14:56:04,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1178#true} is VALID
[2022-04-08 14:56:04,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#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; {1178#true} is VALID
[2022-04-08 14:56:04,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume 0 != ~p1~0;~lk1~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID
[2022-04-08 14:56:04,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1179#false} is VALID
[2022-04-08 14:56:04,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#false} assume 0 != ~p2~0; {1179#false} is VALID
[2022-04-08 14:56:04,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#false} assume 1 != ~lk2~0; {1179#false} is VALID
[2022-04-08 14:56:04,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {1179#false} assume !false; {1179#false} is VALID
[2022-04-08 14:56:04,566 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:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:04,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943493609]
[2022-04-08 14:56:04,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943493609] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:04,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:04,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:04,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:04,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [621576610]
[2022-04-08 14:56:04,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [621576610] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:04,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:04,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444777709]
[2022-04-08 14:56:04,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:04,569 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:04,569 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:04,569 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:04,585 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:04,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:04,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:04,586 INFO L87 Difference]: Start difference. First operand 83 states and 150 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:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:04,795 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions.
[2022-04-08 14:56:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:04,796 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:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:04,796 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:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions.
[2022-04-08 14:56:04,800 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:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions.
[2022-04-08 14:56:04,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions.
[2022-04-08 14:56:04,979 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:56:04,981 INFO L225 Difference]: With dead ends: 127
[2022-04-08 14:56:04,981 INFO L226 Difference]: Without dead ends: 88
[2022-04-08 14:56:04,981 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:04,982 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 133 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.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:04,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2022-04-08 14:56:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86.
[2022-04-08 14:56:04,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:04,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have 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:04,993 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have 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:04,994 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have 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:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:04,996 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions.
[2022-04-08 14:56:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions.
[2022-04-08 14:56:04,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:04,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:04,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states.
[2022-04-08 14:56:04,998 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states.
[2022-04-08 14:56:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:05,000 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions.
[2022-04-08 14:56:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions.
[2022-04-08 14:56:05,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:05,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:05,001 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:05,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have 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:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions.
[2022-04-08 14:56:05,004 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24
[2022-04-08 14:56:05,004 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:05,005 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions.
[2022-04-08 14:56:05,005 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:05,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 152 transitions.
[2022-04-08 14:56:05,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions.
[2022-04-08 14:56:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 14:56:05,135 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:05,136 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:05,136 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-08 14:56:05,138 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 1 times
[2022-04-08 14:56:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:05,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [252324855]
[2022-04-08 14:56:05,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 2 times
[2022-04-08 14:56:05,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:05,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376918893]
[2022-04-08 14:56:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:05,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:05,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1792#true} is VALID
[2022-04-08 14:56:05,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume true; {1792#true} is VALID
[2022-04-08 14:56:05,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID
[2022-04-08 14:56:05,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:05,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1792#true} is VALID
[2022-04-08 14:56:05,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID
[2022-04-08 14:56:05,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID
[2022-04-08 14:56:05,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret17 := main(); {1792#true} is VALID
[2022-04-08 14:56:05,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#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;havoc ~cond~0; {1792#true} is VALID
[2022-04-08 14:56:05,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {1792#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1792#true} is VALID
[2022-04-08 14:56:05,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#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; {1792#true} is VALID
[2022-04-08 14:56:05,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 != ~p1~0); {1792#true} is VALID
[2022-04-08 14:56:05,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume !(0 != ~p2~0); {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {1797#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1797#(= main_~p2~0 0)} is VALID
[2022-04-08 14:56:05,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p2~0; {1793#false} is VALID
[2022-04-08 14:56:05,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#false} assume 1 != ~lk2~0; {1793#false} is VALID
[2022-04-08 14:56:05,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#false} assume !false; {1793#false} is VALID
[2022-04-08 14:56:05,246 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:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:05,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376918893]
[2022-04-08 14:56:05,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376918893] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:05,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:05,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:05,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:05,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [252324855]
[2022-04-08 14:56:05,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [252324855] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:05,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:05,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:05,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157117450]
[2022-04-08 14:56:05,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:05,248 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:05,248 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:05,248 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:05,266 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:05,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:05,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:05,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:05,268 INFO L87 Difference]: Start difference. First operand 86 states and 152 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:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:05,484 INFO L93 Difference]: Finished difference Result 238 states and 432 transitions.
[2022-04-08 14:56:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:05,484 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:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:05,485 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:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions.
[2022-04-08 14:56:05,487 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:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions.
[2022-04-08 14:56:05,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions.
[2022-04-08 14:56:05,672 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:56:05,682 INFO L225 Difference]: With dead ends: 238
[2022-04-08 14:56:05,682 INFO L226 Difference]: Without dead ends: 161
[2022-04-08 14:56:05,684 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:05,685 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 91 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.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:05,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 91 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states.
[2022-04-08 14:56:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159.
[2022-04-08 14:56:05,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:05,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have 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:05,741 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have 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:05,742 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have 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:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:05,747 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions.
[2022-04-08 14:56:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions.
[2022-04-08 14:56:05,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:05,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:05,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states.
[2022-04-08 14:56:05,749 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states.
[2022-04-08 14:56:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:05,755 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions.
[2022-04-08 14:56:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions.
[2022-04-08 14:56:05,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:05,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:05,755 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:05,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have 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:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 285 transitions.
[2022-04-08 14:56:05,761 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 285 transitions. Word has length 24
[2022-04-08 14:56:05,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:05,763 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 285 transitions.
[2022-04-08 14:56:05,763 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:05,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 285 transitions.
[2022-04-08 14:56:06,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 285 transitions.
[2022-04-08 14:56:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 14:56:06,025 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:06,025 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:06,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-04-08 14:56:06,025 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:06,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 1 times
[2022-04-08 14:56:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:06,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276791408]
[2022-04-08 14:56:06,027 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 2 times
[2022-04-08 14:56:06,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:06,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575333102]
[2022-04-08 14:56:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:06,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:06,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {2926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2920#true} is VALID
[2022-04-08 14:56:06,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {2920#true} assume true; {2920#true} is VALID
[2022-04-08 14:56:06,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID
[2022-04-08 14:56:06,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {2920#true} call ULTIMATE.init(); {2926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:06,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2920#true} is VALID
[2022-04-08 14:56:06,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2920#true} assume true; {2920#true} is VALID
[2022-04-08 14:56:06,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID
[2022-04-08 14:56:06,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {2920#true} call #t~ret17 := main(); {2920#true} is VALID
[2022-04-08 14:56:06,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {2920#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;havoc ~cond~0; {2920#true} is VALID
[2022-04-08 14:56:06,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {2920#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {2920#true} is VALID
[2022-04-08 14:56:06,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {2920#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; {2920#true} is VALID
[2022-04-08 14:56:06,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {2920#true} assume !(0 != ~p1~0); {2920#true} is VALID
[2022-04-08 14:56:06,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {2920#true} assume 0 != ~p2~0;~lk2~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {2925#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {2925#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2925#(= main_~lk2~0 1)} is VALID
[2022-04-08 14:56:06,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {2925#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2921#false} is VALID
[2022-04-08 14:56:06,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {2921#false} assume !false; {2921#false} is VALID
[2022-04-08 14:56:06,096 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:06,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:06,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575333102]
[2022-04-08 14:56:06,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575333102] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:06,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:06,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:06,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:06,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276791408]
[2022-04-08 14:56:06,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276791408] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:06,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:06,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024788991]
[2022-04-08 14:56:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:06,098 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:06,098 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:06,098 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:06,114 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:06,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:06,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:06,115 INFO L87 Difference]: Start difference. First operand 159 states and 285 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:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:06,358 INFO L93 Difference]: Finished difference Result 207 states and 371 transitions.
[2022-04-08 14:56:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:06,358 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:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:06,359 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:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions.
[2022-04-08 14:56:06,361 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:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions.
[2022-04-08 14:56:06,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions.
[2022-04-08 14:56:06,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:06,486 INFO L225 Difference]: With dead ends: 207
[2022-04-08 14:56:06,486 INFO L226 Difference]: Without dead ends: 205
[2022-04-08 14:56:06,487 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:06,488 INFO L913 BasicCegarLoop]: 145 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 152 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.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:06,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 152 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2022-04-08 14:56:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159.
[2022-04-08 14:56:06,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:06,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have 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:06,502 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have 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:06,502 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have 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:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:06,508 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions.
[2022-04-08 14:56:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions.
[2022-04-08 14:56:06,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:06,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:06,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states.
[2022-04-08 14:56:06,510 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states.
[2022-04-08 14:56:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:06,516 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions.
[2022-04-08 14:56:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions.
[2022-04-08 14:56:06,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:06,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:06,517 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:06,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have 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:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions.
[2022-04-08 14:56:06,523 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24
[2022-04-08 14:56:06,523 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:06,523 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions.
[2022-04-08 14:56:06,523 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:06,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 283 transitions.
[2022-04-08 14:56:06,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions.
[2022-04-08 14:56:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 14:56:06,802 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:06,803 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:06,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-04-08 14:56:06,803 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 1 times
[2022-04-08 14:56:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:06,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466988356]
[2022-04-08 14:56:06,804 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 2 times
[2022-04-08 14:56:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:06,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51882659]
[2022-04-08 14:56:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:06,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:06,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {4080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4074#true} is VALID
[2022-04-08 14:56:06,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {4074#true} assume true; {4074#true} is VALID
[2022-04-08 14:56:06,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID
[2022-04-08 14:56:06,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {4074#true} call ULTIMATE.init(); {4080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:06,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4074#true} is VALID
[2022-04-08 14:56:06,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {4074#true} assume true; {4074#true} is VALID
[2022-04-08 14:56:06,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID
[2022-04-08 14:56:06,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {4074#true} call #t~ret17 := main(); {4074#true} is VALID
[2022-04-08 14:56:06,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {4074#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;havoc ~cond~0; {4074#true} is VALID
[2022-04-08 14:56:06,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {4074#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {4074#true} is VALID
[2022-04-08 14:56:06,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {4074#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; {4074#true} is VALID
[2022-04-08 14:56:06,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {4074#true} assume !(0 != ~p1~0); {4074#true} is VALID
[2022-04-08 14:56:06,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {4074#true} assume !(0 != ~p2~0); {4074#true} is VALID
[2022-04-08 14:56:06,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {4074#true} assume 0 != ~p3~0;~lk3~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4079#(= main_~lk3~0 1)} is VALID
[2022-04-08 14:56:06,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {4079#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4075#false} is VALID
[2022-04-08 14:56:06,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {4075#false} assume !false; {4075#false} is VALID
[2022-04-08 14:56:06,887 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:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:06,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51882659]
[2022-04-08 14:56:06,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51882659] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:06,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:06,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:06,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:06,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466988356]
[2022-04-08 14:56:06,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466988356] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:06,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:06,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:06,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607065897]
[2022-04-08 14:56:06,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:06,889 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:06,889 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:06,889 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:06,906 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:06,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:06,907 INFO L87 Difference]: Start difference. First operand 159 states and 283 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:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:07,153 INFO L93 Difference]: Finished difference Result 299 states and 539 transitions.
[2022-04-08 14:56:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:07,153 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:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:07,154 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:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions.
[2022-04-08 14:56:07,156 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:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions.
[2022-04-08 14:56:07,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions.
[2022-04-08 14:56:07,286 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:07,294 INFO L225 Difference]: With dead ends: 299
[2022-04-08 14:56:07,295 INFO L226 Difference]: Without dead ends: 297
[2022-04-08 14:56:07,295 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:07,296 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 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.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:07,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states.
[2022-04-08 14:56:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215.
[2022-04-08 14:56:07,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:07,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have 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:07,316 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have 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:07,317 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have 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:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:07,330 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions.
[2022-04-08 14:56:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions.
[2022-04-08 14:56:07,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:07,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:07,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states.
[2022-04-08 14:56:07,336 INFO L87 Difference]: Start difference. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states.
[2022-04-08 14:56:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:07,347 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions.
[2022-04-08 14:56:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions.
[2022-04-08 14:56:07,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:07,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:07,348 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:07,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have 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:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 381 transitions.
[2022-04-08 14:56:07,356 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 381 transitions. Word has length 25
[2022-04-08 14:56:07,357 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:07,357 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 381 transitions.
[2022-04-08 14:56:07,357 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:07,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 381 transitions.
[2022-04-08 14:56:07,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 381 transitions.
[2022-04-08 14:56:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 14:56:07,712 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:07,712 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:07,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-04-08 14:56:07,713 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 1 times
[2022-04-08 14:56:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:07,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [200885551]
[2022-04-08 14:56:07,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 2 times
[2022-04-08 14:56:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:07,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466692948]
[2022-04-08 14:56:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:07,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:07,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:07,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {5714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5708#true} is VALID
[2022-04-08 14:56:07,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {5708#true} assume true; {5708#true} is VALID
[2022-04-08 14:56:07,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID
[2022-04-08 14:56:07,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {5708#true} call ULTIMATE.init(); {5714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:07,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {5714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5708#true} is VALID
[2022-04-08 14:56:07,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {5708#true} assume true; {5708#true} is VALID
[2022-04-08 14:56:07,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID
[2022-04-08 14:56:07,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {5708#true} call #t~ret17 := main(); {5708#true} is VALID
[2022-04-08 14:56:07,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {5708#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;havoc ~cond~0; {5708#true} is VALID
[2022-04-08 14:56:07,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {5708#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {5708#true} is VALID
[2022-04-08 14:56:07,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#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; {5708#true} is VALID
[2022-04-08 14:56:07,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {5708#true} assume !(0 != ~p1~0); {5708#true} is VALID
[2022-04-08 14:56:07,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {5708#true} assume !(0 != ~p2~0); {5708#true} is VALID
[2022-04-08 14:56:07,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {5708#true} assume !(0 != ~p3~0); {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5713#(= main_~p3~0 0)} is VALID
[2022-04-08 14:56:07,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p3~0; {5709#false} is VALID
[2022-04-08 14:56:07,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {5709#false} assume 1 != ~lk3~0; {5709#false} is VALID
[2022-04-08 14:56:07,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {5709#false} assume !false; {5709#false} is VALID
[2022-04-08 14:56:07,776 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:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:07,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466692948]
[2022-04-08 14:56:07,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466692948] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:07,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:07,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:07,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:07,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [200885551]
[2022-04-08 14:56:07,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [200885551] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:07,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:07,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:07,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249882580]
[2022-04-08 14:56:07,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:07,778 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:07,778 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:07,778 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:07,793 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:07,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:07,794 INFO L87 Difference]: Start difference. First operand 215 states and 381 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:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:08,033 INFO L93 Difference]: Finished difference Result 511 states and 915 transitions.
[2022-04-08 14:56:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:08,034 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:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:08,034 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:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions.
[2022-04-08 14:56:08,037 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:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions.
[2022-04-08 14:56:08,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions.
[2022-04-08 14:56:08,186 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 14:56:08,193 INFO L225 Difference]: With dead ends: 511
[2022-04-08 14:56:08,193 INFO L226 Difference]: Without dead ends: 305
[2022-04-08 14:56:08,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:08,196 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 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.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:08,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2022-04-08 14:56:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303.
[2022-04-08 14:56:08,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:08,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have 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:08,221 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have 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:08,221 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have 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:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:08,229 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions.
[2022-04-08 14:56:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions.
[2022-04-08 14:56:08,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:08,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:08,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 305 states.
[2022-04-08 14:56:08,232 INFO L87 Difference]: Start difference. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 305 states.
[2022-04-08 14:56:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:08,240 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions.
[2022-04-08 14:56:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions.
[2022-04-08 14:56:08,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:08,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:08,241 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:08,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have 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:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 535 transitions.
[2022-04-08 14:56:08,251 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 535 transitions. Word has length 25
[2022-04-08 14:56:08,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:08,251 INFO L478 AbstractCegarLoop]: Abstraction has 303 states and 535 transitions.
[2022-04-08 14:56:08,251 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:08,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 303 states and 535 transitions.
[2022-04-08 14:56:08,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 535 transitions.
[2022-04-08 14:56:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 14:56:08,779 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:08,779 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:08,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-04-08 14:56:08,779 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 1 times
[2022-04-08 14:56:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:08,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442969881]
[2022-04-08 14:56:08,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 2 times
[2022-04-08 14:56:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:08,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781183775]
[2022-04-08 14:56:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:08,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {7964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7958#true} is VALID
[2022-04-08 14:56:08,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {7958#true} assume true; {7958#true} is VALID
[2022-04-08 14:56:08,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID
[2022-04-08 14:56:08,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {7958#true} call ULTIMATE.init(); {7964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:08,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {7964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7958#true} is VALID
[2022-04-08 14:56:08,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {7958#true} assume true; {7958#true} is VALID
[2022-04-08 14:56:08,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID
[2022-04-08 14:56:08,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {7958#true} call #t~ret17 := main(); {7958#true} is VALID
[2022-04-08 14:56:08,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {7958#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;havoc ~cond~0; {7958#true} is VALID
[2022-04-08 14:56:08,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {7958#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {7958#true} is VALID
[2022-04-08 14:56:08,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {7958#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; {7958#true} is VALID
[2022-04-08 14:56:08,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {7958#true} assume !(0 != ~p1~0); {7958#true} is VALID
[2022-04-08 14:56:08,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#true} assume !(0 != ~p2~0); {7958#true} is VALID
[2022-04-08 14:56:08,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {7958#true} assume 0 != ~p3~0;~lk3~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7963#(not (= main_~p3~0 0))} is VALID
[2022-04-08 14:56:08,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7959#false} is VALID
[2022-04-08 14:56:08,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {7959#false} assume 0 != ~p4~0; {7959#false} is VALID
[2022-04-08 14:56:08,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {7959#false} assume 1 != ~lk4~0; {7959#false} is VALID
[2022-04-08 14:56:08,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {7959#false} assume !false; {7959#false} is VALID
[2022-04-08 14:56:08,828 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:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:08,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781183775]
[2022-04-08 14:56:08,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781183775] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:08,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:08,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:08,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:08,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442969881]
[2022-04-08 14:56:08,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442969881] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:08,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:08,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:08,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259098509]
[2022-04-08 14:56:08,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:08,830 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:08,830 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:08,830 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:08,846 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:08,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:08,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:08,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:08,847 INFO L87 Difference]: Start difference. First operand 303 states and 535 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:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:09,061 INFO L93 Difference]: Finished difference Result 457 states and 805 transitions.
[2022-04-08 14:56:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:09,062 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:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:09,062 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:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions.
[2022-04-08 14:56:09,064 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:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions.
[2022-04-08 14:56:09,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions.
[2022-04-08 14:56:09,214 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 14:56:09,221 INFO L225 Difference]: With dead ends: 457
[2022-04-08 14:56:09,221 INFO L226 Difference]: Without dead ends: 311
[2022-04-08 14:56:09,222 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:09,222 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 127 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 14:56:09,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 127 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states.
[2022-04-08 14:56:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309.
[2022-04-08 14:56:09,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:09,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have 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:09,246 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have 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:09,247 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have 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:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:09,255 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions.
[2022-04-08 14:56:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions.
[2022-04-08 14:56:09,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:09,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:09,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 311 states.
[2022-04-08 14:56:09,258 INFO L87 Difference]: Start difference. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 311 states.
[2022-04-08 14:56:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:09,266 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions.
[2022-04-08 14:56:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions.
[2022-04-08 14:56:09,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:09,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:09,267 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:09,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have 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:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 539 transitions.
[2022-04-08 14:56:09,277 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 539 transitions. Word has length 26
[2022-04-08 14:56:09,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:09,277 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 539 transitions.
[2022-04-08 14:56:09,278 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:09,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 539 transitions.
[2022-04-08 14:56:09,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 539 transitions.
[2022-04-08 14:56:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 14:56:09,794 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:09,794 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:09,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-04-08 14:56:09,795 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 1 times
[2022-04-08 14:56:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:09,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099481602]
[2022-04-08 14:56:09,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 2 times
[2022-04-08 14:56:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:09,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183512004]
[2022-04-08 14:56:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:09,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:09,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {10130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10124#true} is VALID
[2022-04-08 14:56:09,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#true} assume true; {10124#true} is VALID
[2022-04-08 14:56:09,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID
[2022-04-08 14:56:09,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:09,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {10130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10124#true} is VALID
[2022-04-08 14:56:09,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID
[2022-04-08 14:56:09,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID
[2022-04-08 14:56:09,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret17 := main(); {10124#true} is VALID
[2022-04-08 14:56:09,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {10124#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;havoc ~cond~0; {10124#true} is VALID
[2022-04-08 14:56:09,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {10124#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {10124#true} is VALID
[2022-04-08 14:56:09,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#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; {10124#true} is VALID
[2022-04-08 14:56:09,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 != ~p1~0); {10124#true} is VALID
[2022-04-08 14:56:09,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume !(0 != ~p2~0); {10124#true} is VALID
[2022-04-08 14:56:09,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {10124#true} assume !(0 != ~p3~0); {10124#true} is VALID
[2022-04-08 14:56:09,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {10124#true} assume 0 != ~p4~0;~lk4~0 := 1; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10129#(= main_~lk4~0 1)} is VALID
[2022-04-08 14:56:09,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {10129#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10125#false} is VALID
[2022-04-08 14:56:09,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {10125#false} assume !false; {10125#false} is VALID
[2022-04-08 14:56:09,848 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:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:09,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183512004]
[2022-04-08 14:56:09,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183512004] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:09,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:09,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:09,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:09,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099481602]
[2022-04-08 14:56:09,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099481602] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:09,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:09,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:09,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737674255]
[2022-04-08 14:56:09,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:09,849 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:09,849 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:09,850 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:09,866 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:09,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:09,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:09,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:09,867 INFO L87 Difference]: Start difference. First operand 309 states and 539 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:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:10,118 INFO L93 Difference]: Finished difference Result 573 states and 1013 transitions.
[2022-04-08 14:56:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:10,119 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:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:10,119 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:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions.
[2022-04-08 14:56:10,121 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:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions.
[2022-04-08 14:56:10,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions.
[2022-04-08 14:56:10,229 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:56:10,250 INFO L225 Difference]: With dead ends: 573
[2022-04-08 14:56:10,250 INFO L226 Difference]: Without dead ends: 571
[2022-04-08 14:56:10,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:56:10,251 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 87 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.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:10,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states.
[2022-04-08 14:56:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425.
[2022-04-08 14:56:10,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:10,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have 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:10,285 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have 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:10,286 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have 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:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:10,304 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions.
[2022-04-08 14:56:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions.
[2022-04-08 14:56:10,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:10,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:10,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states.
[2022-04-08 14:56:10,307 INFO L87 Difference]: Start difference. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states.
[2022-04-08 14:56:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:10,327 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions.
[2022-04-08 14:56:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions.
[2022-04-08 14:56:10,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:10,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:10,328 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:10,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have 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:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 731 transitions.
[2022-04-08 14:56:10,346 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 731 transitions. Word has length 26
[2022-04-08 14:56:10,346 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:10,346 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 731 transitions.
[2022-04-08 14:56:10,346 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:10,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 425 states and 731 transitions.
[2022-04-08 14:56:11,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 731 transitions.
[2022-04-08 14:56:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 14:56:11,089 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:11,089 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:11,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-04-08 14:56:11,090 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 1 times
[2022-04-08 14:56:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:11,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248814994]
[2022-04-08 14:56:11,091 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:11,091 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 2 times
[2022-04-08 14:56:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:11,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990979487]
[2022-04-08 14:56:11,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:11,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:11,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {13280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13274#true} is VALID
[2022-04-08 14:56:11,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {13274#true} assume true; {13274#true} is VALID
[2022-04-08 14:56:11,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID
[2022-04-08 14:56:11,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {13274#true} call ULTIMATE.init(); {13280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:11,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {13280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13274#true} is VALID
[2022-04-08 14:56:11,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {13274#true} assume true; {13274#true} is VALID
[2022-04-08 14:56:11,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID
[2022-04-08 14:56:11,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {13274#true} call #t~ret17 := main(); {13274#true} is VALID
[2022-04-08 14:56:11,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {13274#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;havoc ~cond~0; {13274#true} is VALID
[2022-04-08 14:56:11,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {13274#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {13274#true} is VALID
[2022-04-08 14:56:11,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {13274#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; {13274#true} is VALID
[2022-04-08 14:56:11,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {13274#true} assume !(0 != ~p1~0); {13274#true} is VALID
[2022-04-08 14:56:11,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {13274#true} assume !(0 != ~p2~0); {13274#true} is VALID
[2022-04-08 14:56:11,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {13274#true} assume !(0 != ~p3~0); {13274#true} is VALID
[2022-04-08 14:56:11,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {13274#true} assume !(0 != ~p4~0); {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p10~0); {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p1~0); {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p2~0); {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p3~0); {13279#(= main_~p4~0 0)} is VALID
[2022-04-08 14:56:11,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p4~0; {13275#false} is VALID
[2022-04-08 14:56:11,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {13275#false} assume 1 != ~lk4~0; {13275#false} is VALID
[2022-04-08 14:56:11,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {13275#false} assume !false; {13275#false} is VALID
[2022-04-08 14:56:11,137 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:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:11,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990979487]
[2022-04-08 14:56:11,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990979487] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:11,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:11,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:11,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:11,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248814994]
[2022-04-08 14:56:11,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248814994] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:11,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:11,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:11,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354159384]
[2022-04-08 14:56:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:11,139 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:11,139 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:11,139 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:11,157 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:11,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:11,158 INFO L87 Difference]: Start difference. First operand 425 states and 731 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:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:11,470 INFO L93 Difference]: Finished difference Result 1005 states and 1741 transitions.
[2022-04-08 14:56:11,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:11,470 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:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:11,470 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:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions.
[2022-04-08 14:56:11,472 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:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions.
[2022-04-08 14:56:11,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 219 transitions.
[2022-04-08 14:56:11,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:11,667 INFO L225 Difference]: With dead ends: 1005
[2022-04-08 14:56:11,667 INFO L226 Difference]: Without dead ends: 595
[2022-04-08 14:56:11,668 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:11,669 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:11,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states.
[2022-04-08 14:56:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593.
[2022-04-08 14:56:11,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:11,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have 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:11,716 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have 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:11,717 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have 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:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:11,738 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions.
[2022-04-08 14:56:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions.
[2022-04-08 14:56:11,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:11,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:11,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 595 states.
[2022-04-08 14:56:11,742 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 595 states.
[2022-04-08 14:56:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:11,762 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions.
[2022-04-08 14:56:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions.
[2022-04-08 14:56:11,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:11,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:11,763 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:11,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have 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:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1015 transitions.
[2022-04-08 14:56:11,791 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1015 transitions. Word has length 26
[2022-04-08 14:56:11,792 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:11,792 INFO L478 AbstractCegarLoop]: Abstraction has 593 states and 1015 transitions.
[2022-04-08 14:56:11,792 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:11,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 593 states and 1015 transitions.
[2022-04-08 14:56:12,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1015 edges. 1015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1015 transitions.
[2022-04-08 14:56:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 14:56:12,737 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:12,737 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:56:12,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-04-08 14:56:12,737 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 1 times
[2022-04-08 14:56:12,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:12,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1838656161]
[2022-04-08 14:56:12,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 2 times
[2022-04-08 14:56:12,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:12,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412590374]
[2022-04-08 14:56:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:12,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {17678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17672#true} is VALID
[2022-04-08 14:56:12,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {17672#true} assume true; {17672#true} is VALID
[2022-04-08 14:56:12,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID
[2022-04-08 14:56:12,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {17672#true} call ULTIMATE.init(); {17678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:12,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {17678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17672#true} is VALID
[2022-04-08 14:56:12,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {17672#true} assume true; {17672#true} is VALID
[2022-04-08 14:56:12,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID
[2022-04-08 14:56:12,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {17672#true} call #t~ret17 := main(); {17672#true} is VALID
[2022-04-08 14:56:12,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {17672#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;havoc ~cond~0; {17672#true} is VALID
[2022-04-08 14:56:12,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {17672#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {17672#true} is VALID
[2022-04-08 14:56:12,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {17672#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; {17672#true} is VALID
[2022-04-08 14:56:12,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {17672#true} assume !(0 != ~p1~0); {17672#true} is VALID
[2022-04-08 14:56:12,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {17672#true} assume !(0 != ~p2~0); {17672#true} is VALID
[2022-04-08 14:56:12,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {17672#true} assume !(0 != ~p3~0); {17672#true} is VALID
[2022-04-08 14:56:12,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {17672#true} assume 0 != ~p4~0;~lk4~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {17677#(not (= main_~p4~0 0))} is VALID
[2022-04-08 14:56:12,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {17673#false} is VALID
[2022-04-08 14:56:12,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {17673#false} assume 0 != ~p5~0; {17673#false} is VALID
[2022-04-08 14:56:12,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {17673#false} assume 1 != ~lk5~0; {17673#false} is VALID
[2022-04-08 14:56:12,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {17673#false} assume !false; {17673#false} is VALID
[2022-04-08 14:56:12,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:12,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:12,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412590374]
[2022-04-08 14:56:12,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412590374] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:12,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:12,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:12,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:12,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1838656161]
[2022-04-08 14:56:12,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1838656161] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:12,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:12,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284831852]
[2022-04-08 14:56:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:12,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:12,812 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:12,812 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:12,829 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:12,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:12,830 INFO L87 Difference]: Start difference. First operand 593 states and 1015 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:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:13,137 INFO L93 Difference]: Finished difference Result 889 states and 1517 transitions.
[2022-04-08 14:56:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:13,137 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:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:13,138 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:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions.
[2022-04-08 14:56:13,141 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:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions.
[2022-04-08 14:56:13,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 214 transitions.
[2022-04-08 14:56:13,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:13,328 INFO L225 Difference]: With dead ends: 889
[2022-04-08 14:56:13,329 INFO L226 Difference]: Without dead ends: 603
[2022-04-08 14:56:13,329 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:13,330 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:13,330 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states.
[2022-04-08 14:56:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601.
[2022-04-08 14:56:13,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:13,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have 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:13,378 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have 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:13,380 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have 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:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:13,402 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions.
[2022-04-08 14:56:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions.
[2022-04-08 14:56:13,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:13,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:13,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states.
[2022-04-08 14:56:13,406 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states.
[2022-04-08 14:56:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:13,425 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions.
[2022-04-08 14:56:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions.
[2022-04-08 14:56:13,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:13,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:13,426 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:13,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have 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:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1015 transitions.
[2022-04-08 14:56:13,455 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1015 transitions. Word has length 27
[2022-04-08 14:56:13,455 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:13,455 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 1015 transitions.
[2022-04-08 14:56:13,455 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:13,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 1015 transitions.
[2022-04-08 14:56:14,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1015 edges. 1015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1015 transitions.
[2022-04-08 14:56:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 14:56:14,424 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:14,425 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:14,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-04-08 14:56:14,425 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 1 times
[2022-04-08 14:56:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:14,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065105564]
[2022-04-08 14:56:14,426 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:14,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 2 times
[2022-04-08 14:56:14,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:14,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710325177]
[2022-04-08 14:56:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:14,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:14,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {21876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {21870#true} is VALID
[2022-04-08 14:56:14,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {21870#true} assume true; {21870#true} is VALID
[2022-04-08 14:56:14,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID
[2022-04-08 14:56:14,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {21870#true} call ULTIMATE.init(); {21876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:14,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {21876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {21870#true} is VALID
[2022-04-08 14:56:14,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {21870#true} assume true; {21870#true} is VALID
[2022-04-08 14:56:14,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID
[2022-04-08 14:56:14,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {21870#true} call #t~ret17 := main(); {21870#true} is VALID
[2022-04-08 14:56:14,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {21870#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;havoc ~cond~0; {21870#true} is VALID
[2022-04-08 14:56:14,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {21870#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {21870#true} is VALID
[2022-04-08 14:56:14,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {21870#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; {21870#true} is VALID
[2022-04-08 14:56:14,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {21870#true} assume !(0 != ~p1~0); {21870#true} is VALID
[2022-04-08 14:56:14,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {21870#true} assume !(0 != ~p2~0); {21870#true} is VALID
[2022-04-08 14:56:14,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#true} assume !(0 != ~p3~0); {21870#true} is VALID
[2022-04-08 14:56:14,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {21870#true} assume !(0 != ~p4~0); {21870#true} is VALID
[2022-04-08 14:56:14,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {21870#true} assume 0 != ~p5~0;~lk5~0 := 1; {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p5~0; {21875#(= main_~lk5~0 1)} is VALID
[2022-04-08 14:56:14,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {21875#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {21871#false} is VALID
[2022-04-08 14:56:14,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {21871#false} assume !false; {21871#false} is VALID
[2022-04-08 14:56:14,486 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:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710325177]
[2022-04-08 14:56:14,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710325177] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:14,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:14,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:14,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:14,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065105564]
[2022-04-08 14:56:14,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065105564] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:14,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:14,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856646817]
[2022-04-08 14:56:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:14,487 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:14,488 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:14,488 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:14,505 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:14,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:14,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:14,506 INFO L87 Difference]: Start difference. First operand 601 states and 1015 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:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:14,843 INFO L93 Difference]: Finished difference Result 1101 states and 1889 transitions.
[2022-04-08 14:56:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:14,843 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:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:14,844 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:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions.
[2022-04-08 14:56:14,845 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:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions.
[2022-04-08 14:56:14,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions.
[2022-04-08 14:56:14,954 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:56:15,021 INFO L225 Difference]: With dead ends: 1101
[2022-04-08 14:56:15,022 INFO L226 Difference]: Without dead ends: 1099
[2022-04-08 14:56:15,022 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:15,022 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 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:56:15,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states.
[2022-04-08 14:56:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841.
[2022-04-08 14:56:15,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:15,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have 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:15,097 INFO L74 IsIncluded]: Start isIncluded. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have 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:15,098 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have 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:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:15,156 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions.
[2022-04-08 14:56:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions.
[2022-04-08 14:56:15,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:15,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:15,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1099 states.
[2022-04-08 14:56:15,162 INFO L87 Difference]: Start difference. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1099 states.
[2022-04-08 14:56:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:15,221 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions.
[2022-04-08 14:56:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions.
[2022-04-08 14:56:15,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:15,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:15,223 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:15,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have 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:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1391 transitions.
[2022-04-08 14:56:15,278 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1391 transitions. Word has length 27
[2022-04-08 14:56:15,278 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:15,279 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1391 transitions.
[2022-04-08 14:56:15,279 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:15,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 841 states and 1391 transitions.
[2022-04-08 14:56:16,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1391 edges. 1391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1391 transitions.
[2022-04-08 14:56:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 14:56:16,677 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:16,677 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:16,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-04-08 14:56:16,677 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:16,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 1 times
[2022-04-08 14:56:16,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:16,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502382321]
[2022-04-08 14:56:16,678 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 2 times
[2022-04-08 14:56:16,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:16,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396603248]
[2022-04-08 14:56:16,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:16,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {27970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {27964#true} is VALID
[2022-04-08 14:56:16,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {27964#true} assume true; {27964#true} is VALID
[2022-04-08 14:56:16,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID
[2022-04-08 14:56:16,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {27964#true} call ULTIMATE.init(); {27970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:16,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {27970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {27964#true} is VALID
[2022-04-08 14:56:16,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {27964#true} assume true; {27964#true} is VALID
[2022-04-08 14:56:16,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID
[2022-04-08 14:56:16,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {27964#true} call #t~ret17 := main(); {27964#true} is VALID
[2022-04-08 14:56:16,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {27964#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;havoc ~cond~0; {27964#true} is VALID
[2022-04-08 14:56:16,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {27964#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {27964#true} is VALID
[2022-04-08 14:56:16,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {27964#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; {27964#true} is VALID
[2022-04-08 14:56:16,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {27964#true} assume !(0 != ~p1~0); {27964#true} is VALID
[2022-04-08 14:56:16,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {27964#true} assume !(0 != ~p2~0); {27964#true} is VALID
[2022-04-08 14:56:16,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {27964#true} assume !(0 != ~p3~0); {27964#true} is VALID
[2022-04-08 14:56:16,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {27964#true} assume !(0 != ~p4~0); {27964#true} is VALID
[2022-04-08 14:56:16,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {27964#true} assume !(0 != ~p5~0); {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p10~0); {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p1~0); {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p2~0); {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p3~0); {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p4~0); {27969#(= main_~p5~0 0)} is VALID
[2022-04-08 14:56:16,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p5~0; {27965#false} is VALID
[2022-04-08 14:56:16,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {27965#false} assume 1 != ~lk5~0; {27965#false} is VALID
[2022-04-08 14:56:16,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {27965#false} assume !false; {27965#false} is VALID
[2022-04-08 14:56:16,747 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:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:16,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396603248]
[2022-04-08 14:56:16,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396603248] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:16,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:16,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:16,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:16,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502382321]
[2022-04-08 14:56:16,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502382321] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:16,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:16,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026476362]
[2022-04-08 14:56:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:16,749 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:16,749 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:16,749 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:16,766 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:16,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:16,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:16,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:16,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:16,767 INFO L87 Difference]: Start difference. First operand 841 states and 1391 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:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:17,258 INFO L93 Difference]: Finished difference Result 1981 states and 3297 transitions.
[2022-04-08 14:56:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:17,258 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:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:17,258 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:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions.
[2022-04-08 14:56:17,259 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:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions.
[2022-04-08 14:56:17,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 216 transitions.
[2022-04-08 14:56:17,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:17,488 INFO L225 Difference]: With dead ends: 1981
[2022-04-08 14:56:17,488 INFO L226 Difference]: Without dead ends: 1163
[2022-04-08 14:56:17,489 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:17,490 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:17,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states.
[2022-04-08 14:56:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161.
[2022-04-08 14:56:17,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:17,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have 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:17,591 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have 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:17,592 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have 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:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:17,655 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions.
[2022-04-08 14:56:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions.
[2022-04-08 14:56:17,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:17,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:17,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states.
[2022-04-08 14:56:17,688 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states.
[2022-04-08 14:56:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:17,748 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions.
[2022-04-08 14:56:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions.
[2022-04-08 14:56:17,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:17,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:17,750 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:17,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have 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:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1911 transitions.
[2022-04-08 14:56:17,840 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1911 transitions. Word has length 27
[2022-04-08 14:56:17,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:17,840 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1911 transitions.
[2022-04-08 14:56:17,840 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:17,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1911 transitions.
[2022-04-08 14:56:19,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1911 edges. 1911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1911 transitions.
[2022-04-08 14:56:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 14:56:19,708 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:19,708 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:19,708 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-04-08 14:56:19,709 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 1 times
[2022-04-08 14:56:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:19,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648327183]
[2022-04-08 14:56:19,710 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 2 times
[2022-04-08 14:56:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:19,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773286110]
[2022-04-08 14:56:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:19,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {36592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {36586#true} is VALID
[2022-04-08 14:56:19,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {36586#true} assume true; {36586#true} is VALID
[2022-04-08 14:56:19,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID
[2022-04-08 14:56:19,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {36586#true} call ULTIMATE.init(); {36592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:19,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {36592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {36586#true} is VALID
[2022-04-08 14:56:19,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {36586#true} assume true; {36586#true} is VALID
[2022-04-08 14:56:19,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID
[2022-04-08 14:56:19,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {36586#true} call #t~ret17 := main(); {36586#true} is VALID
[2022-04-08 14:56:19,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {36586#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;havoc ~cond~0; {36586#true} is VALID
[2022-04-08 14:56:19,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {36586#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {36586#true} is VALID
[2022-04-08 14:56:19,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {36586#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; {36586#true} is VALID
[2022-04-08 14:56:19,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {36586#true} assume !(0 != ~p1~0); {36586#true} is VALID
[2022-04-08 14:56:19,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {36586#true} assume !(0 != ~p2~0); {36586#true} is VALID
[2022-04-08 14:56:19,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {36586#true} assume !(0 != ~p3~0); {36586#true} is VALID
[2022-04-08 14:56:19,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {36586#true} assume !(0 != ~p4~0); {36586#true} is VALID
[2022-04-08 14:56:19,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {36586#true} assume 0 != ~p5~0;~lk5~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {36591#(not (= main_~p5~0 0))} is VALID
[2022-04-08 14:56:19,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {36587#false} is VALID
[2022-04-08 14:56:19,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {36587#false} assume 0 != ~p6~0; {36587#false} is VALID
[2022-04-08 14:56:19,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {36587#false} assume 1 != ~lk6~0; {36587#false} is VALID
[2022-04-08 14:56:19,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {36587#false} assume !false; {36587#false} is VALID
[2022-04-08 14:56:19,752 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:19,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:19,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773286110]
[2022-04-08 14:56:19,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773286110] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:19,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:19,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:19,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:19,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648327183]
[2022-04-08 14:56:19,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648327183] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:19,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:19,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823913230]
[2022-04-08 14:56:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:19,754 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:19,754 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:19,754 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:19,771 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:19,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:19,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:19,772 INFO L87 Difference]: Start difference. First operand 1161 states and 1911 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:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:20,197 INFO L93 Difference]: Finished difference Result 1741 states and 2857 transitions.
[2022-04-08 14:56:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:20,197 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:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:20,197 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:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions.
[2022-04-08 14:56:20,198 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:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions.
[2022-04-08 14:56:20,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions.
[2022-04-08 14:56:20,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:20,387 INFO L225 Difference]: With dead ends: 1741
[2022-04-08 14:56:20,387 INFO L226 Difference]: Without dead ends: 1179
[2022-04-08 14:56:20,388 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:20,389 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:20,389 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 14:56:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states.
[2022-04-08 14:56:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177.
[2022-04-08 14:56:20,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:20,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have 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:20,492 INFO L74 IsIncluded]: Start isIncluded. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have 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:20,494 INFO L87 Difference]: Start difference. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have 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:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:20,558 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions.
[2022-04-08 14:56:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions.
[2022-04-08 14:56:20,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:20,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:20,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1179 states.
[2022-04-08 14:56:20,564 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1179 states.
[2022-04-08 14:56:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:20,628 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions.
[2022-04-08 14:56:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions.
[2022-04-08 14:56:20,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:20,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:20,630 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:20,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have 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:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1911 transitions.
[2022-04-08 14:56:20,766 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1911 transitions. Word has length 28
[2022-04-08 14:56:20,766 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:20,766 INFO L478 AbstractCegarLoop]: Abstraction has 1177 states and 1911 transitions.
[2022-04-08 14:56:20,766 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:20,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1177 states and 1911 transitions.
[2022-04-08 14:56:22,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1911 edges. 1911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1911 transitions.
[2022-04-08 14:56:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 14:56:22,620 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:22,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]
[2022-04-08 14:56:22,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-04-08 14:56:22,620 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 1 times
[2022-04-08 14:56:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:22,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197418831]
[2022-04-08 14:56:22,624 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 2 times
[2022-04-08 14:56:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:22,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111080179]
[2022-04-08 14:56:22,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:22,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:22,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {44798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {44792#true} is VALID
[2022-04-08 14:56:22,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {44792#true} assume true; {44792#true} is VALID
[2022-04-08 14:56:22,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID
[2022-04-08 14:56:22,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {44792#true} call ULTIMATE.init(); {44798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:22,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {44798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {44792#true} is VALID
[2022-04-08 14:56:22,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {44792#true} assume true; {44792#true} is VALID
[2022-04-08 14:56:22,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID
[2022-04-08 14:56:22,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {44792#true} call #t~ret17 := main(); {44792#true} is VALID
[2022-04-08 14:56:22,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {44792#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;havoc ~cond~0; {44792#true} is VALID
[2022-04-08 14:56:22,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {44792#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {44792#true} is VALID
[2022-04-08 14:56:22,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {44792#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; {44792#true} is VALID
[2022-04-08 14:56:22,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {44792#true} assume !(0 != ~p1~0); {44792#true} is VALID
[2022-04-08 14:56:22,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {44792#true} assume !(0 != ~p2~0); {44792#true} is VALID
[2022-04-08 14:56:22,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {44792#true} assume !(0 != ~p3~0); {44792#true} is VALID
[2022-04-08 14:56:22,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {44792#true} assume !(0 != ~p4~0); {44792#true} is VALID
[2022-04-08 14:56:22,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {44792#true} assume !(0 != ~p5~0); {44792#true} is VALID
[2022-04-08 14:56:22,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {44792#true} assume 0 != ~p6~0;~lk6~0 := 1; {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p6~0; {44797#(= main_~lk6~0 1)} is VALID
[2022-04-08 14:56:22,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {44797#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {44793#false} is VALID
[2022-04-08 14:56:22,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {44793#false} assume !false; {44793#false} is VALID
[2022-04-08 14:56:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:56:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111080179]
[2022-04-08 14:56:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111080179] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:22,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197418831]
[2022-04-08 14:56:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197418831] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536633212]
[2022-04-08 14:56:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:22,676 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:22,676 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:22,676 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:22,694 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:22,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:22,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:22,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:22,695 INFO L87 Difference]: Start difference. First operand 1177 states and 1911 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:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:23,207 INFO L93 Difference]: Finished difference Result 2125 states and 3513 transitions.
[2022-04-08 14:56:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:23,207 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:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:23,207 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:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions.
[2022-04-08 14:56:23,208 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:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions.
[2022-04-08 14:56:23,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions.
[2022-04-08 14:56:23,298 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:56:23,494 INFO L225 Difference]: With dead ends: 2125
[2022-04-08 14:56:23,494 INFO L226 Difference]: Without dead ends: 2123
[2022-04-08 14:56:23,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:23,496 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 85 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 14:56:23,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states.
[2022-04-08 14:56:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673.
[2022-04-08 14:56:23,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:23,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have 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:23,663 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have 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:23,666 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have 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:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:23,862 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions.
[2022-04-08 14:56:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions.
[2022-04-08 14:56:23,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:23,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:23,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states.
[2022-04-08 14:56:23,870 INFO L87 Difference]: Start difference. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states.
[2022-04-08 14:56:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:24,073 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions.
[2022-04-08 14:56:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions.
[2022-04-08 14:56:24,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:24,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:24,076 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:24,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have 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:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2647 transitions.
[2022-04-08 14:56:24,239 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2647 transitions. Word has length 28
[2022-04-08 14:56:24,240 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:24,240 INFO L478 AbstractCegarLoop]: Abstraction has 1673 states and 2647 transitions.
[2022-04-08 14:56:24,240 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:24,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1673 states and 2647 transitions.
[2022-04-08 14:56:26,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2647 edges. 2647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2647 transitions.
[2022-04-08 14:56:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 14:56:26,751 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:26,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]
[2022-04-08 14:56:26,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-04-08 14:56:26,751 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:26,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 1 times
[2022-04-08 14:56:26,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:26,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926312811]
[2022-04-08 14:56:26,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 2 times
[2022-04-08 14:56:26,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:26,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984459652]
[2022-04-08 14:56:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:26,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {56652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {56646#true} is VALID
[2022-04-08 14:56:26,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {56646#true} assume true; {56646#true} is VALID
[2022-04-08 14:56:26,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID
[2022-04-08 14:56:26,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {56646#true} call ULTIMATE.init(); {56652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:26,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {56652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {56646#true} is VALID
[2022-04-08 14:56:26,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {56646#true} assume true; {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {56646#true} call #t~ret17 := main(); {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {56646#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;havoc ~cond~0; {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {56646#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {56646#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; {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {56646#true} assume !(0 != ~p1~0); {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {56646#true} assume !(0 != ~p2~0); {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {56646#true} assume !(0 != ~p3~0); {56646#true} is VALID
[2022-04-08 14:56:26,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {56646#true} assume !(0 != ~p4~0); {56646#true} is VALID
[2022-04-08 14:56:26,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {56646#true} assume !(0 != ~p5~0); {56646#true} is VALID
[2022-04-08 14:56:26,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {56646#true} assume !(0 != ~p6~0); {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p10~0); {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p1~0); {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p2~0); {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p3~0); {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p4~0); {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p5~0); {56651#(= main_~p6~0 0)} is VALID
[2022-04-08 14:56:26,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p6~0; {56647#false} is VALID
[2022-04-08 14:56:26,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {56647#false} assume 1 != ~lk6~0; {56647#false} is VALID
[2022-04-08 14:56:26,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {56647#false} assume !false; {56647#false} is VALID
[2022-04-08 14:56:26,791 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:26,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:26,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984459652]
[2022-04-08 14:56:26,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984459652] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:26,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:26,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:26,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:26,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [926312811]
[2022-04-08 14:56:26,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [926312811] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:26,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:26,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230852911]
[2022-04-08 14:56:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:26,801 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:26,801 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:26,801 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:26,820 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:26,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:26,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:26,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:26,821 INFO L87 Difference]: Start difference. First operand 1673 states and 2647 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:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:27,953 INFO L93 Difference]: Finished difference Result 3917 states and 6233 transitions.
[2022-04-08 14:56:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:27,953 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:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:27,954 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:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions.
[2022-04-08 14:56:27,955 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:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions.
[2022-04-08 14:56:27,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 213 transitions.
[2022-04-08 14:56:28,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:28,292 INFO L225 Difference]: With dead ends: 3917
[2022-04-08 14:56:28,292 INFO L226 Difference]: Without dead ends: 2283
[2022-04-08 14:56:28,294 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:56:28,295 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:28,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states.
[2022-04-08 14:56:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281.
[2022-04-08 14:56:28,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:28,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have 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:28,503 INFO L74 IsIncluded]: Start isIncluded. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have 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:28,505 INFO L87 Difference]: Start difference. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have 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:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:28,718 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions.
[2022-04-08 14:56:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions.
[2022-04-08 14:56:28,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:28,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:28,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2283 states.
[2022-04-08 14:56:28,728 INFO L87 Difference]: Start difference. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2283 states.
[2022-04-08 14:56:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:28,896 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions.
[2022-04-08 14:56:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions.
[2022-04-08 14:56:28,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:28,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:28,898 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:28,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have 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:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3591 transitions.
[2022-04-08 14:56:29,174 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3591 transitions. Word has length 28
[2022-04-08 14:56:29,174 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:29,174 INFO L478 AbstractCegarLoop]: Abstraction has 2281 states and 3591 transitions.
[2022-04-08 14:56:29,174 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:29,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2281 states and 3591 transitions.
[2022-04-08 14:56:32,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3591 edges. 3591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3591 transitions.
[2022-04-08 14:56:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 14:56:32,721 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:32,721 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:32,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-04-08 14:56:32,721 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 1 times
[2022-04-08 14:56:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:32,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670095498]
[2022-04-08 14:56:32,722 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 2 times
[2022-04-08 14:56:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:32,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127596874]
[2022-04-08 14:56:32,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:32,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:32,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {73626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {73620#true} is VALID
[2022-04-08 14:56:32,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {73620#true} assume true; {73620#true} is VALID
[2022-04-08 14:56:32,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID
[2022-04-08 14:56:32,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {73620#true} call ULTIMATE.init(); {73626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:32,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {73626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {73620#true} is VALID
[2022-04-08 14:56:32,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {73620#true} assume true; {73620#true} is VALID
[2022-04-08 14:56:32,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID
[2022-04-08 14:56:32,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {73620#true} call #t~ret17 := main(); {73620#true} is VALID
[2022-04-08 14:56:32,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {73620#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;havoc ~cond~0; {73620#true} is VALID
[2022-04-08 14:56:32,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {73620#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {73620#true} is VALID
[2022-04-08 14:56:32,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {73620#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; {73620#true} is VALID
[2022-04-08 14:56:32,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {73620#true} assume !(0 != ~p1~0); {73620#true} is VALID
[2022-04-08 14:56:32,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {73620#true} assume !(0 != ~p2~0); {73620#true} is VALID
[2022-04-08 14:56:32,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {73620#true} assume !(0 != ~p3~0); {73620#true} is VALID
[2022-04-08 14:56:32,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {73620#true} assume !(0 != ~p4~0); {73620#true} is VALID
[2022-04-08 14:56:32,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {73620#true} assume !(0 != ~p5~0); {73620#true} is VALID
[2022-04-08 14:56:32,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {73620#true} assume 0 != ~p6~0;~lk6~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {73625#(not (= main_~p6~0 0))} is VALID
[2022-04-08 14:56:32,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {73621#false} is VALID
[2022-04-08 14:56:32,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {73621#false} assume 0 != ~p7~0; {73621#false} is VALID
[2022-04-08 14:56:32,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {73621#false} assume 1 != ~lk7~0; {73621#false} is VALID
[2022-04-08 14:56:32,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {73621#false} assume !false; {73621#false} is VALID
[2022-04-08 14:56:32,764 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:32,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:32,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127596874]
[2022-04-08 14:56:32,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127596874] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:32,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:32,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:32,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:32,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670095498]
[2022-04-08 14:56:32,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670095498] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:32,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:32,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611392485]
[2022-04-08 14:56:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:32,769 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:32,769 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:32,769 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:32,786 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:32,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:32,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:32,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:32,787 INFO L87 Difference]: Start difference. First operand 2281 states and 3591 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:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:33,686 INFO L93 Difference]: Finished difference Result 3421 states and 5369 transitions.
[2022-04-08 14:56:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:33,686 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:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:33,686 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:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions.
[2022-04-08 14:56:33,688 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:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions.
[2022-04-08 14:56:33,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions.
[2022-04-08 14:56:33,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:34,040 INFO L225 Difference]: With dead ends: 3421
[2022-04-08 14:56:34,040 INFO L226 Difference]: Without dead ends: 2315
[2022-04-08 14:56:34,041 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:34,042 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:34,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 118 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states.
[2022-04-08 14:56:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313.
[2022-04-08 14:56:34,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:34,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have 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:34,297 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have 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:34,299 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have 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:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:34,462 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions.
[2022-04-08 14:56:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions.
[2022-04-08 14:56:34,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:34,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:34,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states 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:34,468 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states 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:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:34,638 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions.
[2022-04-08 14:56:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions.
[2022-04-08 14:56:34,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:34,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:34,640 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:34,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have 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:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3591 transitions.
[2022-04-08 14:56:34,929 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3591 transitions. Word has length 29
[2022-04-08 14:56:34,929 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:34,929 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 3591 transitions.
[2022-04-08 14:56:34,930 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:34,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 3591 transitions.
[2022-04-08 14:56:38,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3591 edges. 3591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3591 transitions.
[2022-04-08 14:56:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 14:56:38,540 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:38,540 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:38,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-04-08 14:56:38,540 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:38,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 1 times
[2022-04-08 14:56:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:38,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398113691]
[2022-04-08 14:56:38,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 2 times
[2022-04-08 14:56:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:38,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418834610]
[2022-04-08 14:56:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:38,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {89736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {89730#true} is VALID
[2022-04-08 14:56:38,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {89730#true} assume true; {89730#true} is VALID
[2022-04-08 14:56:38,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID
[2022-04-08 14:56:38,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {89730#true} call ULTIMATE.init(); {89736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:38,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {89736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {89730#true} is VALID
[2022-04-08 14:56:38,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {89730#true} assume true; {89730#true} is VALID
[2022-04-08 14:56:38,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID
[2022-04-08 14:56:38,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {89730#true} call #t~ret17 := main(); {89730#true} is VALID
[2022-04-08 14:56:38,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {89730#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;havoc ~cond~0; {89730#true} is VALID
[2022-04-08 14:56:38,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {89730#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {89730#true} is VALID
[2022-04-08 14:56:38,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {89730#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; {89730#true} is VALID
[2022-04-08 14:56:38,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {89730#true} assume !(0 != ~p1~0); {89730#true} is VALID
[2022-04-08 14:56:38,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {89730#true} assume !(0 != ~p2~0); {89730#true} is VALID
[2022-04-08 14:56:38,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {89730#true} assume !(0 != ~p3~0); {89730#true} is VALID
[2022-04-08 14:56:38,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {89730#true} assume !(0 != ~p4~0); {89730#true} is VALID
[2022-04-08 14:56:38,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {89730#true} assume !(0 != ~p5~0); {89730#true} is VALID
[2022-04-08 14:56:38,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {89730#true} assume !(0 != ~p6~0); {89730#true} is VALID
[2022-04-08 14:56:38,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {89730#true} assume 0 != ~p7~0;~lk7~0 := 1; {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p7~0; {89735#(= main_~lk7~0 1)} is VALID
[2022-04-08 14:56:38,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {89735#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {89731#false} is VALID
[2022-04-08 14:56:38,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {89731#false} assume !false; {89731#false} is VALID
[2022-04-08 14:56:38,608 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,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:38,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418834610]
[2022-04-08 14:56:38,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418834610] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:38,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:38,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:38,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:38,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398113691]
[2022-04-08 14:56:38,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398113691] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:38,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:38,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499688354]
[2022-04-08 14:56:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:38,609 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:38,610 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:38,610 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:38,628 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:38,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:38,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:38,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:38,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:38,629 INFO L87 Difference]: Start difference. First operand 2313 states and 3591 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:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:39,973 INFO L93 Difference]: Finished difference Result 4109 states and 6505 transitions.
[2022-04-08 14:56:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:39,974 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:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:39,974 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:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions.
[2022-04-08 14:56:39,975 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:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions.
[2022-04-08 14:56:39,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions.
[2022-04-08 14:56:40,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:40,800 INFO L225 Difference]: With dead ends: 4109
[2022-04-08 14:56:40,800 INFO L226 Difference]: Without dead ends: 4107
[2022-04-08 14:56:40,801 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,801 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:40,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 84 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states.
[2022-04-08 14:56:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337.
[2022-04-08 14:56:41,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:41,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have 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,044 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have 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,046 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have 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,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:41,602 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions.
[2022-04-08 14:56:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions.
[2022-04-08 14:56:41,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:41,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:41,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states.
[2022-04-08 14:56:41,611 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states.
[2022-04-08 14:56:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:42,138 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions.
[2022-04-08 14:56:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions.
[2022-04-08 14:56:42,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:42,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:42,142 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:42,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have 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,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5031 transitions.
[2022-04-08 14:56:42,740 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5031 transitions. Word has length 29
[2022-04-08 14:56:42,740 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:42,740 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 5031 transitions.
[2022-04-08 14:56:42,740 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:42,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 5031 transitions.
[2022-04-08 14:56:47,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5031 edges. 5031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5031 transitions.
[2022-04-08 14:56:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 14:56:47,844 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:56:47,844 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:47,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-04-08 14:56:47,845 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:56:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:56:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 1 times
[2022-04-08 14:56:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:47,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2005102140]
[2022-04-08 14:56:47,845 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:56:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 2 times
[2022-04-08 14:56:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:56:47,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059587011]
[2022-04-08 14:56:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:56:47,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:56:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:56:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:56:47,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {112854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {112848#true} is VALID
[2022-04-08 14:56:47,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {112848#true} assume true; {112848#true} is VALID
[2022-04-08 14:56:47,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {112848#true} call ULTIMATE.init(); {112854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:56:47,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {112854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {112848#true} assume true; {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {112848#true} call #t~ret17 := main(); {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {112848#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;havoc ~cond~0; {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {112848#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {112848#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; {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {112848#true} assume !(0 != ~p1~0); {112848#true} is VALID
[2022-04-08 14:56:47,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {112848#true} assume !(0 != ~p2~0); {112848#true} is VALID
[2022-04-08 14:56:47,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {112848#true} assume !(0 != ~p3~0); {112848#true} is VALID
[2022-04-08 14:56:47,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {112848#true} assume !(0 != ~p4~0); {112848#true} is VALID
[2022-04-08 14:56:47,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {112848#true} assume !(0 != ~p5~0); {112848#true} is VALID
[2022-04-08 14:56:47,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {112848#true} assume !(0 != ~p6~0); {112848#true} is VALID
[2022-04-08 14:56:47,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {112848#true} assume !(0 != ~p7~0); {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p10~0); {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p1~0); {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p2~0); {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p3~0); {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p4~0); {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p5~0); {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p6~0); {112853#(= main_~p7~0 0)} is VALID
[2022-04-08 14:56:47,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p7~0; {112849#false} is VALID
[2022-04-08 14:56:47,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {112849#false} assume 1 != ~lk7~0; {112849#false} is VALID
[2022-04-08 14:56:47,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {112849#false} assume !false; {112849#false} is VALID
[2022-04-08 14:56:47,893 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:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:56:47,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059587011]
[2022-04-08 14:56:47,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059587011] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:47,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:47,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:47,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:56:47,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2005102140]
[2022-04-08 14:56:47,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2005102140] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:56:47,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:56:47,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:56:47,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860244082]
[2022-04-08 14:56:47,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:56:47,894 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:47,894 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:56:47,894 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:47,911 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:47,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:56:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:56:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:56:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:56:47,912 INFO L87 Difference]: Start difference. First operand 3337 states and 5031 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:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:51,324 INFO L93 Difference]: Finished difference Result 7757 states and 11753 transitions.
[2022-04-08 14:56:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:56:51,325 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:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:56:51,325 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:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions.
[2022-04-08 14:56:51,326 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:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions.
[2022-04-08 14:56:51,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions.
[2022-04-08 14:56:51,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:56:52,329 INFO L225 Difference]: With dead ends: 7757
[2022-04-08 14:56:52,329 INFO L226 Difference]: Without dead ends: 4491
[2022-04-08 14:56:52,334 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:52,335 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:56:52,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:56:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states.
[2022-04-08 14:56:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489.
[2022-04-08 14:56:52,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:56:52,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have 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,700 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have 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,703 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have 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,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:53,357 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions.
[2022-04-08 14:56:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions.
[2022-04-08 14:56:53,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:53,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:53,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states 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:56:53,374 INFO L87 Difference]: Start difference. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states 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:56:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:56:54,052 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions.
[2022-04-08 14:56:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions.
[2022-04-08 14:56:54,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:56:54,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:56:54,057 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:56:54,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:56:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have 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,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6727 transitions.
[2022-04-08 14:56:55,141 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6727 transitions. Word has length 29
[2022-04-08 14:56:55,141 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:56:55,141 INFO L478 AbstractCegarLoop]: Abstraction has 4489 states and 6727 transitions.
[2022-04-08 14:56:55,141 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:55,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4489 states and 6727 transitions.
[2022-04-08 14:57:02,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6727 edges. 6727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6727 transitions.
[2022-04-08 14:57:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 14:57:02,132 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:57:02,132 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:02,133 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-04-08 14:57:02,133 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:57:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:57:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 1 times
[2022-04-08 14:57:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:02,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1357825409]
[2022-04-08 14:57:02,134 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:57:02,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 2 times
[2022-04-08 14:57:02,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:57:02,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897192450]
[2022-04-08 14:57:02,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:57:02,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:57:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:57:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:02,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {146340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {146334#true} is VALID
[2022-04-08 14:57:02,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#true} assume true; {146334#true} is VALID
[2022-04-08 14:57:02,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID
[2022-04-08 14:57:02,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:57:02,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {146340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {146334#true} is VALID
[2022-04-08 14:57:02,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {146334#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;havoc ~cond~0; {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {146334#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {146334#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; {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {146334#true} assume !(0 != ~p1~0); {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {146334#true} assume !(0 != ~p2~0); {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {146334#true} assume !(0 != ~p3~0); {146334#true} is VALID
[2022-04-08 14:57:02,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {146334#true} assume !(0 != ~p4~0); {146334#true} is VALID
[2022-04-08 14:57:02,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {146334#true} assume !(0 != ~p5~0); {146334#true} is VALID
[2022-04-08 14:57:02,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {146334#true} assume !(0 != ~p6~0); {146334#true} is VALID
[2022-04-08 14:57:02,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {146334#true} assume 0 != ~p7~0;~lk7~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {146339#(not (= main_~p7~0 0))} is VALID
[2022-04-08 14:57:02,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {146335#false} is VALID
[2022-04-08 14:57:02,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {146335#false} assume 0 != ~p8~0; {146335#false} is VALID
[2022-04-08 14:57:02,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {146335#false} assume 1 != ~lk8~0; {146335#false} is VALID
[2022-04-08 14:57:02,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {146335#false} assume !false; {146335#false} is VALID
[2022-04-08 14:57:02,180 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:02,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:57:02,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897192450]
[2022-04-08 14:57:02,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897192450] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:02,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:02,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:02,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:57:02,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1357825409]
[2022-04-08 14:57:02,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1357825409] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:02,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:02,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:02,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855858560]
[2022-04-08 14:57:02,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:57:02,182 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:02,183 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:57:02,183 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:02,200 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:02,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:57:02,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:57:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:57:02,201 INFO L87 Difference]: Start difference. First operand 4489 states and 6727 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:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:05,014 INFO L93 Difference]: Finished difference Result 6733 states and 10057 transitions.
[2022-04-08 14:57:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:05,014 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,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:05,015 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:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions.
[2022-04-08 14:57:05,016 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:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions.
[2022-04-08 14:57:05,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions.
[2022-04-08 14:57:05,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:06,065 INFO L225 Difference]: With dead ends: 6733
[2022-04-08 14:57:06,065 INFO L226 Difference]: Without dead ends: 4555
[2022-04-08 14:57:06,070 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,071 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:06,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 115 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states.
[2022-04-08 14:57:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553.
[2022-04-08 14:57:06,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:06,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have 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,420 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have 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,425 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have 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,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:07,123 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions.
[2022-04-08 14:57:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions.
[2022-04-08 14:57:07,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:07,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:07,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4555 states.
[2022-04-08 14:57:07,140 INFO L87 Difference]: Start difference. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4555 states.
[2022-04-08 14:57:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:07,795 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions.
[2022-04-08 14:57:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions.
[2022-04-08 14:57:07,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:07,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:07,801 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:57:07,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:57:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have 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:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6727 transitions.
[2022-04-08 14:57:08,823 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6727 transitions. Word has length 30
[2022-04-08 14:57:08,823 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:57:08,824 INFO L478 AbstractCegarLoop]: Abstraction has 4553 states and 6727 transitions.
[2022-04-08 14:57:08,824 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:08,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4553 states and 6727 transitions.
[2022-04-08 14:57:15,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6727 edges. 6727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6727 transitions.
[2022-04-08 14:57:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 14:57:15,962 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:57:15,963 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:15,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-04-08 14:57:15,963 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:57:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:57:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 1 times
[2022-04-08 14:57:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:15,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [135318776]
[2022-04-08 14:57:15,963 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:57:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 2 times
[2022-04-08 14:57:15,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:57:15,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783819314]
[2022-04-08 14:57:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:57:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:57:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:16,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:57:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:16,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {178034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {178028#true} is VALID
[2022-04-08 14:57:16,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {178028#true} assume true; {178028#true} is VALID
[2022-04-08 14:57:16,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID
[2022-04-08 14:57:16,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {178028#true} call ULTIMATE.init(); {178034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:57:16,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {178034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {178028#true} is VALID
[2022-04-08 14:57:16,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {178028#true} assume true; {178028#true} is VALID
[2022-04-08 14:57:16,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID
[2022-04-08 14:57:16,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {178028#true} call #t~ret17 := main(); {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {178028#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;havoc ~cond~0; {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {178028#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {178028#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; {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {178028#true} assume !(0 != ~p1~0); {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {178028#true} assume !(0 != ~p2~0); {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {178028#true} assume !(0 != ~p3~0); {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {178028#true} assume !(0 != ~p4~0); {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {178028#true} assume !(0 != ~p5~0); {178028#true} is VALID
[2022-04-08 14:57:16,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {178028#true} assume !(0 != ~p6~0); {178028#true} is VALID
[2022-04-08 14:57:16,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {178028#true} assume !(0 != ~p7~0); {178028#true} is VALID
[2022-04-08 14:57:16,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {178028#true} assume 0 != ~p8~0;~lk8~0 := 1; {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p8~0; {178033#(= main_~lk8~0 1)} is VALID
[2022-04-08 14:57:16,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {178033#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {178029#false} is VALID
[2022-04-08 14:57:16,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {178029#false} assume !false; {178029#false} is VALID
[2022-04-08 14:57:16,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:16,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:57:16,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783819314]
[2022-04-08 14:57:16,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783819314] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:16,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:16,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:16,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:57:16,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [135318776]
[2022-04-08 14:57:16,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [135318776] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:16,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:16,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:16,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39968091]
[2022-04-08 14:57:16,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:57:16,013 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:16,013 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:57:16,013 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:16,031 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:16,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:57:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:57:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:57:16,032 INFO L87 Difference]: Start difference. First operand 4553 states and 6727 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:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:19,874 INFO L93 Difference]: Finished difference Result 7949 states and 11977 transitions.
[2022-04-08 14:57:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:19,874 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:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:19,874 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:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions.
[2022-04-08 14:57:19,875 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:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions.
[2022-04-08 14:57:19,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions.
[2022-04-08 14:57:19,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:22,822 INFO L225 Difference]: With dead ends: 7949
[2022-04-08 14:57:22,822 INFO L226 Difference]: Without dead ends: 7947
[2022-04-08 14:57:22,823 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:22,824 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:22,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states.
[2022-04-08 14:57:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665.
[2022-04-08 14:57:23,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:23,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have 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:23,354 INFO L74 IsIncluded]: Start isIncluded. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have 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:23,361 INFO L87 Difference]: Start difference. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have 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,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:25,525 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions.
[2022-04-08 14:57:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions.
[2022-04-08 14:57:25,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:25,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:25,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7947 states.
[2022-04-08 14:57:25,546 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7947 states.
[2022-04-08 14:57:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:27,620 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions.
[2022-04-08 14:57:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions.
[2022-04-08 14:57:27,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:57:27,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:57:27,626 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:57:27,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:57:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have 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:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9543 transitions.
[2022-04-08 14:57:30,077 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9543 transitions. Word has length 30
[2022-04-08 14:57:30,077 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:57:30,077 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 9543 transitions.
[2022-04-08 14:57:30,077 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:30,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 9543 transitions.
[2022-04-08 14:57:40,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9543 edges. 9543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9543 transitions.
[2022-04-08 14:57:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 14:57:40,207 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:57:40,208 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:57:40,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-04-08 14:57:40,208 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:57:40,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:57:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 1 times
[2022-04-08 14:57:40,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:40,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [568620323]
[2022-04-08 14:57:40,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:57:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 2 times
[2022-04-08 14:57:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:57:40,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417014480]
[2022-04-08 14:57:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:57:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:57:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:57:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:57:40,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {223168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {223162#true} is VALID
[2022-04-08 14:57:40,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {223162#true} assume true; {223162#true} is VALID
[2022-04-08 14:57:40,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID
[2022-04-08 14:57:40,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {223162#true} call ULTIMATE.init(); {223168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:57:40,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {223168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {223162#true} is VALID
[2022-04-08 14:57:40,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {223162#true} assume true; {223162#true} is VALID
[2022-04-08 14:57:40,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {223162#true} call #t~ret17 := main(); {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {223162#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;havoc ~cond~0; {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {223162#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {223162#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; {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {223162#true} assume !(0 != ~p1~0); {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {223162#true} assume !(0 != ~p2~0); {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {223162#true} assume !(0 != ~p3~0); {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {223162#true} assume !(0 != ~p4~0); {223162#true} is VALID
[2022-04-08 14:57:40,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {223162#true} assume !(0 != ~p5~0); {223162#true} is VALID
[2022-04-08 14:57:40,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {223162#true} assume !(0 != ~p6~0); {223162#true} is VALID
[2022-04-08 14:57:40,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {223162#true} assume !(0 != ~p7~0); {223162#true} is VALID
[2022-04-08 14:57:40,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {223162#true} assume !(0 != ~p8~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p10~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p1~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p2~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p3~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p4~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p5~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p6~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p7~0); {223167#(= main_~p8~0 0)} is VALID
[2022-04-08 14:57:40,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p8~0; {223163#false} is VALID
[2022-04-08 14:57:40,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {223163#false} assume 1 != ~lk8~0; {223163#false} is VALID
[2022-04-08 14:57:40,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {223163#false} assume !false; {223163#false} is VALID
[2022-04-08 14:57:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:57:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:57:40,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417014480]
[2022-04-08 14:57:40,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417014480] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:40,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:40,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:40,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:57:40,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [568620323]
[2022-04-08 14:57:40,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [568620323] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:57:40,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:57:40,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:57:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491333219]
[2022-04-08 14:57:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:57:40,268 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:40,268 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:57:40,268 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:40,287 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:40,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:57:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:57:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:57:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:57:40,288 INFO L87 Difference]: Start difference. First operand 6665 states and 9543 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:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:57:53,914 INFO L93 Difference]: Finished difference Result 15373 states and 22089 transitions.
[2022-04-08 14:57:53,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:57:53,914 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:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:57:53,914 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:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions.
[2022-04-08 14:57:53,915 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:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions.
[2022-04-08 14:57:53,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 207 transitions.
[2022-04-08 14:57:54,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:57:57,663 INFO L225 Difference]: With dead ends: 15373
[2022-04-08 14:57:57,663 INFO L226 Difference]: Without dead ends: 8843
[2022-04-08 14:57:57,670 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:57,671 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:57:57,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:57:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states.
[2022-04-08 14:57:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841.
[2022-04-08 14:57:58,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:57:58,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have 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,383 INFO L74 IsIncluded]: Start isIncluded. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have 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,392 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have 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:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:00,713 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions.
[2022-04-08 14:58:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions.
[2022-04-08 14:58:00,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:58:00,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:58:00,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8843 states.
[2022-04-08 14:58:00,741 INFO L87 Difference]: Start difference. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8843 states.
[2022-04-08 14:58:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:03,222 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions.
[2022-04-08 14:58:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions.
[2022-04-08 14:58:03,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:58:03,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:58:03,229 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:58:03,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:58:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have 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:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12551 transitions.
[2022-04-08 14:58:07,303 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12551 transitions. Word has length 30
[2022-04-08 14:58:07,303 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:58:07,304 INFO L478 AbstractCegarLoop]: Abstraction has 8841 states and 12551 transitions.
[2022-04-08 14:58:07,304 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:58:07,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8841 states and 12551 transitions.
[2022-04-08 14:58:21,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12551 edges. 12551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:58:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12551 transitions.
[2022-04-08 14:58:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 14:58:21,087 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:58:21,088 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:21,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-04-08 14:58:21,088 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:58:21,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:58:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 1 times
[2022-04-08 14:58:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:58:21,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707634482]
[2022-04-08 14:58:21,088 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:58:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 2 times
[2022-04-08 14:58:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:58:21,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444770899]
[2022-04-08 14:58:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:58:21,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:58:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:58:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:58:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:58:21,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {289294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {289288#true} is VALID
[2022-04-08 14:58:21,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {289288#true} assume true; {289288#true} is VALID
[2022-04-08 14:58:21,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID
[2022-04-08 14:58:21,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {289288#true} call ULTIMATE.init(); {289294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:58:21,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {289294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {289288#true} assume true; {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {289288#true} call #t~ret17 := main(); {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {289288#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;havoc ~cond~0; {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {289288#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {289288#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; {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {289288#true} assume !(0 != ~p1~0); {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {289288#true} assume !(0 != ~p2~0); {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {289288#true} assume !(0 != ~p3~0); {289288#true} is VALID
[2022-04-08 14:58:21,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {289288#true} assume !(0 != ~p4~0); {289288#true} is VALID
[2022-04-08 14:58:21,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {289288#true} assume !(0 != ~p5~0); {289288#true} is VALID
[2022-04-08 14:58:21,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {289288#true} assume !(0 != ~p6~0); {289288#true} is VALID
[2022-04-08 14:58:21,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {289288#true} assume !(0 != ~p7~0); {289288#true} is VALID
[2022-04-08 14:58:21,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {289288#true} assume 0 != ~p8~0;~lk8~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {289293#(not (= main_~p8~0 0))} is VALID
[2022-04-08 14:58:21,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {289289#false} is VALID
[2022-04-08 14:58:21,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {289289#false} assume 0 != ~p9~0; {289289#false} is VALID
[2022-04-08 14:58:21,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {289289#false} assume 1 != ~lk9~0; {289289#false} is VALID
[2022-04-08 14:58:21,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {289289#false} assume !false; {289289#false} is VALID
[2022-04-08 14:58:21,137 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:21,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:58:21,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444770899]
[2022-04-08 14:58:21,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444770899] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:58:21,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:58:21,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:58:21,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:58:21,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707634482]
[2022-04-08 14:58:21,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707634482] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:58:21,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:58:21,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:58:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285655605]
[2022-04-08 14:58:21,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:58:21,139 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:21,139 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:58:21,139 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:21,157 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:21,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:58:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:58:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:58:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:58:21,158 INFO L87 Difference]: Start difference. First operand 8841 states and 12551 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:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:31,300 INFO L93 Difference]: Finished difference Result 13261 states and 18761 transitions.
[2022-04-08 14:58:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:58:31,301 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:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:58:31,301 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:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions.
[2022-04-08 14:58:31,302 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:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions.
[2022-04-08 14:58:31,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions.
[2022-04-08 14:58:31,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:58:35,001 INFO L225 Difference]: With dead ends: 13261
[2022-04-08 14:58:35,001 INFO L226 Difference]: Without dead ends: 8971
[2022-04-08 14:58:35,007 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:35,007 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:58:35,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:58:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states.
[2022-04-08 14:58:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969.
[2022-04-08 14:58:35,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:58:35,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have 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:35,767 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have 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:35,777 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have 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,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:38,546 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions.
[2022-04-08 14:58:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions.
[2022-04-08 14:58:38,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:58:38,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:58:38,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8971 states.
[2022-04-08 14:58:38,588 INFO L87 Difference]: Start difference. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8971 states.
[2022-04-08 14:58:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:58:41,437 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions.
[2022-04-08 14:58:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions.
[2022-04-08 14:58:41,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:58:41,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:58:41,444 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:58:41,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:58:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have 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:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12551 transitions.
[2022-04-08 14:58:45,567 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12551 transitions. Word has length 31
[2022-04-08 14:58:45,567 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:58:45,567 INFO L478 AbstractCegarLoop]: Abstraction has 8969 states and 12551 transitions.
[2022-04-08 14:58:45,567 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:45,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8969 states and 12551 transitions.
[2022-04-08 14:58:59,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12551 edges. 12551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:58:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12551 transitions.
[2022-04-08 14:58:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 14:58:59,565 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:58:59,565 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:59,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-04-08 14:58:59,565 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:58:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:58:59,565 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 1 times
[2022-04-08 14:58:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:58:59,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255531104]
[2022-04-08 14:58:59,566 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:58:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 2 times
[2022-04-08 14:58:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:58:59,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44308559]
[2022-04-08 14:58:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:58:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:58:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:58:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:58:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:58:59,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {351708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {351702#true} is VALID
[2022-04-08 14:58:59,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {351702#true} assume true; {351702#true} is VALID
[2022-04-08 14:58:59,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID
[2022-04-08 14:58:59,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {351702#true} call ULTIMATE.init(); {351708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:58:59,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {351708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {351702#true} is VALID
[2022-04-08 14:58:59,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {351702#true} assume true; {351702#true} is VALID
[2022-04-08 14:58:59,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID
[2022-04-08 14:58:59,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {351702#true} call #t~ret17 := main(); {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {351702#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;havoc ~cond~0; {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {351702#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {351702#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; {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {351702#true} assume !(0 != ~p1~0); {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {351702#true} assume !(0 != ~p2~0); {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {351702#true} assume !(0 != ~p3~0); {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {351702#true} assume !(0 != ~p4~0); {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {351702#true} assume !(0 != ~p5~0); {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {351702#true} assume !(0 != ~p6~0); {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {351702#true} assume !(0 != ~p7~0); {351702#true} is VALID
[2022-04-08 14:58:59,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {351702#true} assume !(0 != ~p8~0); {351702#true} is VALID
[2022-04-08 14:58:59,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {351702#true} assume 0 != ~p9~0;~lk9~0 := 1; {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p9~0; {351707#(= main_~lk9~0 1)} is VALID
[2022-04-08 14:58:59,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {351707#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {351703#false} is VALID
[2022-04-08 14:58:59,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {351703#false} assume !false; {351703#false} is VALID
[2022-04-08 14:58:59,616 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:59,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:58:59,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44308559]
[2022-04-08 14:58:59,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44308559] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:58:59,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:58:59,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:58:59,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:58:59,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255531104]
[2022-04-08 14:58:59,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255531104] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:58:59,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:58:59,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:58:59,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934442092]
[2022-04-08 14:58:59,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:58:59,617 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:59,617 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:58:59,617 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:59,636 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:59,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:58:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:58:59,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:58:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:58:59,637 INFO L87 Difference]: Start difference. First operand 8969 states and 12551 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:59:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:59:13,881 INFO L93 Difference]: Finished difference Result 15373 states and 21897 transitions.
[2022-04-08 14:59:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:59:13,881 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:59:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:59:13,881 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:59:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions.
[2022-04-08 14:59:13,882 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:59:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions.
[2022-04-08 14:59:13,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions.
[2022-04-08 14:59:13,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:59:25,024 INFO L225 Difference]: With dead ends: 15373
[2022-04-08 14:59:25,024 INFO L226 Difference]: Without dead ends: 15371
[2022-04-08 14:59:25,028 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:25,028 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:59:25,029 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:59:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states.
[2022-04-08 14:59:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321.
[2022-04-08 14:59:26,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:59:26,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have 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:26,186 INFO L74 IsIncluded]: Start isIncluded. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have 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:26,200 INFO L87 Difference]: Start difference. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have 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:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:59:33,145 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions.
[2022-04-08 14:59:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions.
[2022-04-08 14:59:33,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:59:33,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:59:33,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15371 states.
[2022-04-08 14:59:33,182 INFO L87 Difference]: Start difference. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15371 states.
[2022-04-08 14:59:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:59:41,038 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions.
[2022-04-08 14:59:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions.
[2022-04-08 14:59:41,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:59:41,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:59:41,051 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:59:41,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:59:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have 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:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 18055 transitions.
[2022-04-08 14:59:50,381 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 18055 transitions. Word has length 31
[2022-04-08 14:59:50,381 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:59:50,382 INFO L478 AbstractCegarLoop]: Abstraction has 13321 states and 18055 transitions.
[2022-04-08 14:59:50,382 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:59:50,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13321 states and 18055 transitions.
[2022-04-08 15:00:10,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18055 edges. 18055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:00:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 18055 transitions.
[2022-04-08 15:00:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 15:00:10,425 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 15:00:10,425 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 15:00:10,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2022-04-08 15:00:10,425 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 15:00:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 15:00:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 1 times
[2022-04-08 15:00:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:00:10,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044115189]
[2022-04-08 15:00:10,427 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 15:00:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 2 times
[2022-04-08 15:00:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 15:00:10,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141597797]
[2022-04-08 15:00:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 15:00:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 15:00:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:00:10,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 15:00:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:00:10,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {439850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {439844#true} is VALID
[2022-04-08 15:00:10,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {439844#true} assume true; {439844#true} is VALID
[2022-04-08 15:00:10,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID
[2022-04-08 15:00:10,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {439844#true} call ULTIMATE.init(); {439850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 15:00:10,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {439850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {439844#true} is VALID
[2022-04-08 15:00:10,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {439844#true} assume true; {439844#true} is VALID
[2022-04-08 15:00:10,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID
[2022-04-08 15:00:10,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {439844#true} call #t~ret17 := main(); {439844#true} is VALID
[2022-04-08 15:00:10,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {439844#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;havoc ~cond~0; {439844#true} is VALID
[2022-04-08 15:00:10,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {439844#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {439844#true} is VALID
[2022-04-08 15:00:10,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {439844#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; {439844#true} is VALID
[2022-04-08 15:00:10,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {439844#true} assume !(0 != ~p1~0); {439844#true} is VALID
[2022-04-08 15:00:10,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {439844#true} assume !(0 != ~p2~0); {439844#true} is VALID
[2022-04-08 15:00:10,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {439844#true} assume !(0 != ~p3~0); {439844#true} is VALID
[2022-04-08 15:00:10,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {439844#true} assume !(0 != ~p4~0); {439844#true} is VALID
[2022-04-08 15:00:10,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {439844#true} assume !(0 != ~p5~0); {439844#true} is VALID
[2022-04-08 15:00:10,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {439844#true} assume !(0 != ~p6~0); {439844#true} is VALID
[2022-04-08 15:00:10,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {439844#true} assume !(0 != ~p7~0); {439844#true} is VALID
[2022-04-08 15:00:10,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {439844#true} assume !(0 != ~p8~0); {439844#true} is VALID
[2022-04-08 15:00:10,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {439844#true} assume !(0 != ~p9~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p10~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p1~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p2~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p3~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p4~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p5~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p6~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p7~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p8~0); {439849#(= main_~p9~0 0)} is VALID
[2022-04-08 15:00:10,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p9~0; {439845#false} is VALID
[2022-04-08 15:00:10,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {439845#false} assume 1 != ~lk9~0; {439845#false} is VALID
[2022-04-08 15:00:10,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {439845#false} assume !false; {439845#false} is VALID
[2022-04-08 15:00:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 15:00:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 15:00:10,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141597797]
[2022-04-08 15:00:10,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141597797] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:00:10,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:00:10,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:00:10,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 15:00:10,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044115189]
[2022-04-08 15:00:10,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044115189] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:00:10,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:00:10,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:00:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689175696]
[2022-04-08 15:00:10,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 15:00:10,470 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 15:00:10,470 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 15:00:10,470 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 15:00:10,488 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 15:00:10,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 15:00:10,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:00:10,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 15:00:10,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 15:00:10,489 INFO L87 Difference]: Start difference. First operand 13321 states and 18055 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 15:01:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:01:53,370 INFO L93 Difference]: Finished difference Result 30477 states and 41353 transitions.
[2022-04-08 15:01:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 15:01:53,370 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 15:01:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 15:01:53,370 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 15:01:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions.
[2022-04-08 15:01:53,371 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 15:01:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions.
[2022-04-08 15:01:53,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions.
[2022-04-08 15:01:53,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:02:07,288 INFO L225 Difference]: With dead ends: 30477
[2022-04-08 15:02:07,289 INFO L226 Difference]: Without dead ends: 17419
[2022-04-08 15:02:07,304 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:07,305 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 15:02:07,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 15:02:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states.
[2022-04-08 15:02:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417.
[2022-04-08 15:02:08,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 15:02:08,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have 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,804 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have 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,825 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have 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:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:02:17,631 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions.
[2022-04-08 15:02:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions.
[2022-04-08 15:02:17,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:02:17,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:02:17,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17419 states.
[2022-04-08 15:02:17,685 INFO L87 Difference]: Start difference. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17419 states.
[2022-04-08 15:02:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:02:26,995 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions.
[2022-04-08 15:02:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions.
[2022-04-08 15:02:27,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:02:27,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:02:27,006 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 15:02:27,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 15:02:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have 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:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 23303 transitions.
[2022-04-08 15:02:42,651 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 23303 transitions. Word has length 31
[2022-04-08 15:02:42,651 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 15:02:42,651 INFO L478 AbstractCegarLoop]: Abstraction has 17417 states and 23303 transitions.
[2022-04-08 15:02:42,651 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 15:02:42,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17417 states and 23303 transitions.
[2022-04-08 15:03:09,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23303 edges. 23303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:03:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 23303 transitions.
[2022-04-08 15:03:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 15:03:09,189 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 15:03:09,189 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:03:09,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2022-04-08 15:03:09,190 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 15:03:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 15:03:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 1 times
[2022-04-08 15:03:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:03:09,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1314447125]
[2022-04-08 15:03:09,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 15:03:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 2 times
[2022-04-08 15:03:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 15:03:09,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696519207]
[2022-04-08 15:03:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 15:03:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 15:03:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:03:09,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 15:03:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:03:09,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {570488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {570482#true} is VALID
[2022-04-08 15:03:09,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {570482#true} assume true; {570482#true} is VALID
[2022-04-08 15:03:09,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID
[2022-04-08 15:03:09,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {570482#true} call ULTIMATE.init(); {570488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 15:03:09,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {570488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {570482#true} is VALID
[2022-04-08 15:03:09,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {570482#true} assume true; {570482#true} is VALID
[2022-04-08 15:03:09,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID
[2022-04-08 15:03:09,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {570482#true} call #t~ret17 := main(); {570482#true} is VALID
[2022-04-08 15:03:09,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {570482#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;havoc ~cond~0; {570482#true} is VALID
[2022-04-08 15:03:09,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {570482#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {570482#true} is VALID
[2022-04-08 15:03:09,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {570482#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; {570482#true} is VALID
[2022-04-08 15:03:09,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {570482#true} assume !(0 != ~p1~0); {570482#true} is VALID
[2022-04-08 15:03:09,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {570482#true} assume !(0 != ~p2~0); {570482#true} is VALID
[2022-04-08 15:03:09,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {570482#true} assume !(0 != ~p3~0); {570482#true} is VALID
[2022-04-08 15:03:09,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {570482#true} assume !(0 != ~p4~0); {570482#true} is VALID
[2022-04-08 15:03:09,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {570482#true} assume !(0 != ~p5~0); {570482#true} is VALID
[2022-04-08 15:03:09,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {570482#true} assume !(0 != ~p6~0); {570482#true} is VALID
[2022-04-08 15:03:09,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {570482#true} assume !(0 != ~p7~0); {570482#true} is VALID
[2022-04-08 15:03:09,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {570482#true} assume !(0 != ~p8~0); {570482#true} is VALID
[2022-04-08 15:03:09,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {570482#true} assume 0 != ~p9~0;~lk9~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {570487#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {570487#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {570487#(not (= main_~p9~0 0))} is VALID
[2022-04-08 15:03:09,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {570483#false} is VALID
[2022-04-08 15:03:09,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {570483#false} assume 0 != ~p10~0; {570483#false} is VALID
[2022-04-08 15:03:09,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {570483#false} assume 1 != ~lk10~0; {570483#false} is VALID
[2022-04-08 15:03:09,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {570483#false} assume !false; {570483#false} is VALID
[2022-04-08 15:03:09,240 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,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 15:03:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696519207]
[2022-04-08 15:03:09,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696519207] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:03:09,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:03:09,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:03:09,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 15:03:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1314447125]
[2022-04-08 15:03:09,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1314447125] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:03:09,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:03:09,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:03:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286121860]
[2022-04-08 15:03:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 15:03:09,241 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:03:09,242 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 15:03:09,242 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:03:09,261 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:03:09,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 15:03:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:03:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 15:03:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 15:03:09,262 INFO L87 Difference]: Start difference. First operand 17417 states and 23303 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:03:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:03:49,353 INFO L93 Difference]: Finished difference Result 26125 states and 34825 transitions.
[2022-04-08 15:03:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 15:03:49,353 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:03:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 15:03:49,353 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:03:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions.
[2022-04-08 15:03:49,355 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:03:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions.
[2022-04-08 15:03:49,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions.
[2022-04-08 15:03:49,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:04:04,161 INFO L225 Difference]: With dead ends: 26125
[2022-04-08 15:04:04,161 INFO L226 Difference]: Without dead ends: 17675
[2022-04-08 15:04:04,172 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:04,172 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 15:04:04,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 15:04:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states.
[2022-04-08 15:04:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673.
[2022-04-08 15:04:05,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 15:04:05,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have 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:05,746 INFO L74 IsIncluded]: Start isIncluded. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have 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:05,770 INFO L87 Difference]: Start difference. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have 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:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:04:15,226 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions.
[2022-04-08 15:04:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions.
[2022-04-08 15:04:15,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:04:15,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:04:15,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17675 states.
[2022-04-08 15:04:15,275 INFO L87 Difference]: Start difference. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17675 states.
[2022-04-08 15:04:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 15:04:26,085 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions.
[2022-04-08 15:04:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions.
[2022-04-08 15:04:26,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 15:04:26,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 15:04:26,097 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 15:04:26,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 15:04:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have 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:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 23303 transitions.
[2022-04-08 15:04:42,410 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 23303 transitions. Word has length 32
[2022-04-08 15:04:42,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 15:04:42,410 INFO L478 AbstractCegarLoop]: Abstraction has 17673 states and 23303 transitions.
[2022-04-08 15:04:42,410 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:04:42,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17673 states and 23303 transitions.
[2022-04-08 15:05:08,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23303 edges. 23303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 15:05:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 23303 transitions.
[2022-04-08 15:05:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 15:05:08,823 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 15:05:08,823 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:05:08,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2022-04-08 15:05:08,823 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 15:05:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 15:05:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 1 times
[2022-04-08 15:05:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:05:08,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211179709]
[2022-04-08 15:05:08,824 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 15:05:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 2 times
[2022-04-08 15:05:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 15:05:08,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471175607]
[2022-04-08 15:05:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 15:05:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 15:05:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:05:08,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 15:05:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 15:05:08,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {693446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {693440#true} is VALID
[2022-04-08 15:05:08,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {693440#true} assume true; {693440#true} is VALID
[2022-04-08 15:05:08,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID
[2022-04-08 15:05:08,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {693440#true} call ULTIMATE.init(); {693446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 15:05:08,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {693446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {693440#true} is VALID
[2022-04-08 15:05:08,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {693440#true} assume true; {693440#true} is VALID
[2022-04-08 15:05:08,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID
[2022-04-08 15:05:08,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {693440#true} call #t~ret17 := main(); {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {693440#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;havoc ~cond~0; {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {693440#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {693440#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; {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {693440#true} assume !(0 != ~p1~0); {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {693440#true} assume !(0 != ~p2~0); {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {693440#true} assume !(0 != ~p3~0); {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {693440#true} assume !(0 != ~p4~0); {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {693440#true} assume !(0 != ~p5~0); {693440#true} is VALID
[2022-04-08 15:05:08,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {693440#true} assume !(0 != ~p6~0); {693440#true} is VALID
[2022-04-08 15:05:08,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {693440#true} assume !(0 != ~p7~0); {693440#true} is VALID
[2022-04-08 15:05:08,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {693440#true} assume !(0 != ~p8~0); {693440#true} is VALID
[2022-04-08 15:05:08,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {693440#true} assume !(0 != ~p9~0); {693440#true} is VALID
[2022-04-08 15:05:08,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {693440#true} assume !(0 != ~p10~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p1~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p2~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p3~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p4~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p5~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p6~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p7~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p8~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p9~0); {693445#(= main_~p10~0 0)} is VALID
[2022-04-08 15:05:08,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p10~0; {693441#false} is VALID
[2022-04-08 15:05:08,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {693441#false} assume 1 != ~lk10~0; {693441#false} is VALID
[2022-04-08 15:05:08,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {693441#false} assume !false; {693441#false} is VALID
[2022-04-08 15:05:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 15:05:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 15:05:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471175607]
[2022-04-08 15:05:08,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471175607] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:05:08,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:05:08,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:05:08,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 15:05:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211179709]
[2022-04-08 15:05:08,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211179709] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 15:05:08,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 15:05:08,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 15:05:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255237007]
[2022-04-08 15:05:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 15:05:08,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 15:05:08,866 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 15:05:08,866 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:05:08,884 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:05:08,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 15:05:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 15:05:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 15:05:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 15:05:08,885 INFO L87 Difference]: Start difference. First operand 17673 states and 23303 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)