/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:02:40,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:02:40,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:02:40,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:02:40,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:02:40,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:02:40,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:02:40,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:02:40,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:02:40,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:02:40,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:02:40,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:02:40,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:02:40,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:02:40,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:02:40,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:02:40,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:02:40,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:02:40,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:02:40,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:02:40,115 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:02:40,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:02:40,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:02:40,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:02:40,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:02:40,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:02:40,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:02:40,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:02:40,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:02:40,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:02:40,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:02:40,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:02:40,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:02:40,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:02:40,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:02:40,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:02:40,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:02:40,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:02:40,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:02:40,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:02:40,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:02:40,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:02:40,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 02:02:40,150 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:02:40,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:02:40,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 02:02:40,151 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 02:02:40,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 02:02:40,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 02:02:40,152 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 02:02:40,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:02:40,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:02:40,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:02:40,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:02:40,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:02:40,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:02:40,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:02:40,153 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:02:40,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:02:40,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:02:40,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:02:40,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:02:40,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:02:40,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:02:40,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 02:02:40,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 02:02:40,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 02:02:40,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 02:02:40,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:02:40,155 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 02:02:40,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 02:02:40,155 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 02:02:40,155 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:02:40,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:02:40,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:02:40,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:02:40,352 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:02:40,352 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:02:40,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-04-28 02:02:40,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bb2cb100/c8a1513f781840d8a1c9c1daff0920a9/FLAG90d1760f3 [2022-04-28 02:02:40,724 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:02:40,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-04-28 02:02:40,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bb2cb100/c8a1513f781840d8a1c9c1daff0920a9/FLAG90d1760f3 [2022-04-28 02:02:41,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bb2cb100/c8a1513f781840d8a1c9c1daff0920a9 [2022-04-28 02:02:41,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:02:41,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 02:02:41,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:02:41,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:02:41,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:02:41,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3e8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41, skipping insertion in model container [2022-04-28 02:02:41,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:02:41,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:02:41,376 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_7.c[2881,2894] [2022-04-28 02:02:41,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:02:41,383 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:02:41,398 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_7.c[2881,2894] [2022-04-28 02:02:41,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:02:41,407 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:02:41,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41 WrapperNode [2022-04-28 02:02:41,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:02:41,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:02:41,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:02:41,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:02:41,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:02:41,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:02:41,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:02:41,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:02:41,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:02:41,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:02:41,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:02:41,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:02:41,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:02:41,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:02:41,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:02:41,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:02:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:02:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:02:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:02:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:02:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:02:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:02:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:02:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:02:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:02:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:02:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:02:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:02:41,572 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:02:41,573 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:02:41,701 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:02:41,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:02:41,706 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:02:41,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:41 BoogieIcfgContainer [2022-04-28 02:02:41,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:02:41,708 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 02:02:41,708 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 02:02:41,720 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 02:02:41,722 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:41" (1/1) ... [2022-04-28 02:02:41,723 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 02:02:41,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:02:41 BasicIcfg [2022-04-28 02:02:41,765 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 02:02:41,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:02:41,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:02:41,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:02:41,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:02:41" (1/4) ... [2022-04-28 02:02:41,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7639ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:02:41, skipping insertion in model container [2022-04-28 02:02:41,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:41" (2/4) ... [2022-04-28 02:02:41,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7639ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:02:41, skipping insertion in model container [2022-04-28 02:02:41,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:41" (3/4) ... [2022-04-28 02:02:41,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7639ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:02:41, skipping insertion in model container [2022-04-28 02:02:41,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:02:41" (4/4) ... [2022-04-28 02:02:41,785 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.cqvasr [2022-04-28 02:02:41,793 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:02:41,794 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:02:41,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:02:41,830 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@aabba20, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@63052c23 [2022-04-28 02:02:41,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:02:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:02:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:02:41,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:41,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:41,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:41,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash -172104918, now seen corresponding path program 1 times [2022-04-28 02:02:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478280262] [2022-04-28 02:02:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:42,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {39#true} is VALID [2022-04-28 02:02:42,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-28 02:02:42,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-28 02:02:42,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:42,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {39#true} is VALID [2022-04-28 02:02:42,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-28 02:02:42,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-28 02:02:42,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-28 02:02:42,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {39#true} is VALID [2022-04-28 02:02:42,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {39#true} is VALID [2022-04-28 02:02:42,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {39#true} is VALID [2022-04-28 02:02:42,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} [165] L53-->L53-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {44#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:42,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#(= main_~lk1~0 1)} [167] L53-2-->L57-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {44#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:42,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#(= main_~lk1~0 1)} [169] L57-1-->L61-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {44#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:42,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#(= main_~lk1~0 1)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {44#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:42,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#(= main_~lk1~0 1)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {44#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:42,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#(= main_~lk1~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {44#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:42,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#(= main_~lk1~0 1)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {44#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:42,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#(= main_~lk1~0 1)} [179] L77-1-->L84: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {44#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:42,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#(= main_~lk1~0 1)} [181] L84-->L114-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-28 02:02:42,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-28 02:02:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:42,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478280262] [2022-04-28 02:02:42,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478280262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:42,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:42,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:42,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123821576] [2022-04-28 02:02:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:42,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:02:42,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:42,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:42,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:42,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:42,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:42,158 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:42,377 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-28 02:02:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:02:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 02:02:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 02:02:42,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 02:02:42,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:42,501 INFO L225 Difference]: With dead ends: 70 [2022-04-28 02:02:42,501 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 02:02:42,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:42,505 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:42,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:02:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 02:02:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-04-28 02:02:42,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:42,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,544 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,545 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:42,551 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-28 02:02:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-28 02:02:42,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:42,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:42,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 02:02:42,554 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 02:02:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:42,560 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-28 02:02:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-28 02:02:42,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:42,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:42,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:42,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-04-28 02:02:42,568 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-04-28 02:02:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:42,568 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-04-28 02:02:42,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-04-28 02:02:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:02:42,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:42,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:42,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:02:42,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:42,570 INFO L85 PathProgramCache]: Analyzing trace with hash -368618423, now seen corresponding path program 1 times [2022-04-28 02:02:42,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:42,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609527804] [2022-04-28 02:02:42,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:42,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {288#true} is VALID [2022-04-28 02:02:42,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-28 02:02:42,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-28 02:02:42,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:42,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {288#true} is VALID [2022-04-28 02:02:42,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-28 02:02:42,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-28 02:02:42,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#true} is VALID [2022-04-28 02:02:42,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {288#true} is VALID [2022-04-28 02:02:42,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {288#true} is VALID [2022-04-28 02:02:42,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {288#true} is VALID [2022-04-28 02:02:42,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {293#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:42,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(= main_~p1~0 0)} [167] L53-2-->L57-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {293#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:42,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#(= main_~p1~0 0)} [169] L57-1-->L61-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {293#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:42,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#(= main_~p1~0 0)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {293#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:42,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(= main_~p1~0 0)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {293#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:42,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(= main_~p1~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {293#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:42,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {293#(= main_~p1~0 0)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {293#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:42,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {293#(= main_~p1~0 0)} [179] L77-1-->L84: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {289#false} is VALID [2022-04-28 02:02:42,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#false} [181] L84-->L114-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {289#false} is VALID [2022-04-28 02:02:42,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {289#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#false} is VALID [2022-04-28 02:02:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:42,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:42,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609527804] [2022-04-28 02:02:42,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609527804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:42,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:42,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920070985] [2022-04-28 02:02:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:42,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:02:42,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:42,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:42,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:42,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:42,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:42,643 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:42,822 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-28 02:02:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:42,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:02:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 02:02:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 02:02:42,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-28 02:02:42,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:42,930 INFO L225 Difference]: With dead ends: 88 [2022-04-28 02:02:42,930 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 02:02:42,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:42,932 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:42,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:02:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 02:02:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-28 02:02:42,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:42,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,936 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,936 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:42,938 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-28 02:02:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-28 02:02:42,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:42,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:42,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 02:02:42,939 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 02:02:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:42,940 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-28 02:02:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-28 02:02:42,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:42,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:42,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:42,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-04-28 02:02:42,943 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-04-28 02:02:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:42,943 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-04-28 02:02:42,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-04-28 02:02:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 02:02:42,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:42,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:42,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:02:42,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1040253202, now seen corresponding path program 1 times [2022-04-28 02:02:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:42,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444885442] [2022-04-28 02:02:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:42,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:43,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {568#true} is VALID [2022-04-28 02:02:43,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:02:43,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:02:43,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:43,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {568#true} is VALID [2022-04-28 02:02:43,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {568#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:02:43,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {568#true} {568#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:02:43,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {568#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:02:43,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {568#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {568#true} is VALID [2022-04-28 02:02:43,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {568#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {568#true} is VALID [2022-04-28 02:02:43,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {568#true} is VALID [2022-04-28 02:02:43,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#true} [165] L53-->L53-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {573#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:43,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(not (= main_~p1~0 0))} [167] L53-2-->L57-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {573#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:43,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(not (= main_~p1~0 0))} [169] L57-1-->L61-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {573#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:43,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {573#(not (= main_~p1~0 0))} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {573#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:43,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {573#(not (= main_~p1~0 0))} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {573#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:43,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {573#(not (= main_~p1~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {573#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:43,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {573#(not (= main_~p1~0 0))} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {573#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:43,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {573#(not (= main_~p1~0 0))} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {569#false} is VALID [2022-04-28 02:02:43,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#false} [183] L83-1-->L89: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {569#false} is VALID [2022-04-28 02:02:43,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} [187] L89-->L114-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {569#false} is VALID [2022-04-28 02:02:43,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#false} is VALID [2022-04-28 02:02:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:43,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:43,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444885442] [2022-04-28 02:02:43,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444885442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:43,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:43,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097330784] [2022-04-28 02:02:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:43,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 02:02:43,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:43,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:43,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:43,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:43,027 INFO L87 Difference]: Start difference. First operand 53 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,132 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-04-28 02:02:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 02:02:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 02:02:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 02:02:43,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-28 02:02:43,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:43,214 INFO L225 Difference]: With dead ends: 82 [2022-04-28 02:02:43,214 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 02:02:43,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:43,221 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:43,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 02:02:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-28 02:02:43,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:43,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,232 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,232 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,233 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-28 02:02:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-28 02:02:43,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:43,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:43,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 02:02:43,234 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 02:02:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,235 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-28 02:02:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-28 02:02:43,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:43,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:43,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:43,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-04-28 02:02:43,238 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-04-28 02:02:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:43,238 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-04-28 02:02:43,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-04-28 02:02:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 02:02:43,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:43,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:43,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:02:43,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:43,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1457762735, now seen corresponding path program 1 times [2022-04-28 02:02:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:43,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727833743] [2022-04-28 02:02:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:43,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {853#true} is VALID [2022-04-28 02:02:43,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {853#true} is VALID [2022-04-28 02:02:43,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {853#true} {853#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {853#true} is VALID [2022-04-28 02:02:43,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:43,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {853#true} is VALID [2022-04-28 02:02:43,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {853#true} is VALID [2022-04-28 02:02:43,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {853#true} is VALID [2022-04-28 02:02:43,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {853#true} is VALID [2022-04-28 02:02:43,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {853#true} is VALID [2022-04-28 02:02:43,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {853#true} is VALID [2022-04-28 02:02:43,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {853#true} is VALID [2022-04-28 02:02:43,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {853#true} is VALID [2022-04-28 02:02:43,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} [167] L53-2-->L57-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {858#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:43,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(= main_~lk2~0 1)} [169] L57-1-->L61-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {858#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:43,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(= main_~lk2~0 1)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {858#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:43,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(= main_~lk2~0 1)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {858#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:43,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {858#(= main_~lk2~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {858#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:43,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {858#(= main_~lk2~0 1)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {858#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:43,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {858#(= main_~lk2~0 1)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {858#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:43,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {858#(= main_~lk2~0 1)} [183] L83-1-->L89: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {858#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:43,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {858#(= main_~lk2~0 1)} [187] L89-->L114-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {854#false} is VALID [2022-04-28 02:02:43,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {854#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {854#false} is VALID [2022-04-28 02:02:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:43,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727833743] [2022-04-28 02:02:43,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727833743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:43,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:43,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186674154] [2022-04-28 02:02:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 02:02:43,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:43,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:43,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:43,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:43,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:43,323 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,432 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions. [2022-04-28 02:02:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 02:02:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 02:02:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 02:02:43,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 02:02:43,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:43,523 INFO L225 Difference]: With dead ends: 101 [2022-04-28 02:02:43,523 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 02:02:43,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:43,524 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:43,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 59 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 02:02:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2022-04-28 02:02:43,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:43,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,536 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,536 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,539 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2022-04-28 02:02:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 166 transitions. [2022-04-28 02:02:43,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:43,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:43,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-28 02:02:43,545 INFO L87 Difference]: Start difference. First operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-28 02:02:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,549 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2022-04-28 02:02:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 166 transitions. [2022-04-28 02:02:43,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:43,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:43,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:43,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 121 transitions. [2022-04-28 02:02:43,551 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 121 transitions. Word has length 19 [2022-04-28 02:02:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:43,551 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 121 transitions. [2022-04-28 02:02:43,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2022-04-28 02:02:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 02:02:43,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:43,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:43,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:02:43,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:43,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:43,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1261249230, now seen corresponding path program 1 times [2022-04-28 02:02:43,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:43,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520030263] [2022-04-28 02:02:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:43,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:43,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1257#true} is VALID [2022-04-28 02:02:43,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 02:02:43,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 02:02:43,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:43,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1257#true} is VALID [2022-04-28 02:02:43,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 02:02:43,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 02:02:43,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 02:02:43,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {1257#true} is VALID [2022-04-28 02:02:43,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {1257#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {1257#true} is VALID [2022-04-28 02:02:43,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {1257#true} is VALID [2022-04-28 02:02:43,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {1257#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 02:02:43,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1262#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:43,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {1262#(= main_~p2~0 0)} [169] L57-1-->L61-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1262#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:43,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(= main_~p2~0 0)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1262#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:43,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#(= main_~p2~0 0)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1262#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:43,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(= main_~p2~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {1262#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:43,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#(= main_~p2~0 0)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1262#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:43,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#(= main_~p2~0 0)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1262#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:43,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(= main_~p2~0 0)} [183] L83-1-->L89: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-28 02:02:43,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {1258#false} [187] L89-->L114-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-28 02:02:43,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-28 02:02:43,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-28 02:02:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:43,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520030263] [2022-04-28 02:02:43,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520030263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:43,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:43,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:43,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533144005] [2022-04-28 02:02:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 02:02:43,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:43,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:43,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:43,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:43,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:43,619 INFO L87 Difference]: Start difference. First operand 73 states and 121 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,785 INFO L93 Difference]: Finished difference Result 165 states and 279 transitions. [2022-04-28 02:02:43,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:43,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 02:02:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 02:02:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 02:02:43,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-28 02:02:43,888 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-28 02:02:43,889 INFO L225 Difference]: With dead ends: 165 [2022-04-28 02:02:43,889 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 02:02:43,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:43,890 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:43,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 73 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 02:02:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-28 02:02:43,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:43,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,894 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,895 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,896 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2022-04-28 02:02:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 164 transitions. [2022-04-28 02:02:43,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:43,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:43,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 02:02:43,897 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 02:02:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:43,899 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2022-04-28 02:02:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 164 transitions. [2022-04-28 02:02:43,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:43,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:43,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:43,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-04-28 02:02:43,902 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-04-28 02:02:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:43,902 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-04-28 02:02:43,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-04-28 02:02:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:02:43,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:43,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:43,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:02:43,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:43,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2053963387, now seen corresponding path program 1 times [2022-04-28 02:02:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:43,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497278607] [2022-04-28 02:02:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:43,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {1765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1759#true} is VALID [2022-04-28 02:02:43,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1759#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1759#true} is VALID [2022-04-28 02:02:43,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1759#true} {1759#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1759#true} is VALID [2022-04-28 02:02:43,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {1759#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:43,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1759#true} is VALID [2022-04-28 02:02:43,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1759#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1759#true} is VALID [2022-04-28 02:02:43,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1759#true} {1759#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1759#true} is VALID [2022-04-28 02:02:43,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {1759#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1759#true} is VALID [2022-04-28 02:02:43,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {1759#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {1759#true} is VALID [2022-04-28 02:02:43,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {1759#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {1759#true} is VALID [2022-04-28 02:02:43,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {1759#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {1759#true} is VALID [2022-04-28 02:02:43,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {1759#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1759#true} is VALID [2022-04-28 02:02:43,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {1759#true} [167] L53-2-->L57-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {1764#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:43,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {1764#(not (= main_~p2~0 0))} [169] L57-1-->L61-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1764#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:43,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {1764#(not (= main_~p2~0 0))} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1764#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:43,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {1764#(not (= main_~p2~0 0))} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1764#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:43,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {1764#(not (= main_~p2~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {1764#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:43,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {1764#(not (= main_~p2~0 0))} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1764#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:43,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {1764#(not (= main_~p2~0 0))} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1764#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:43,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {1764#(not (= main_~p2~0 0))} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {1760#false} is VALID [2022-04-28 02:02:43,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {1760#false} [189] L88-1-->L94: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {1760#false} is VALID [2022-04-28 02:02:43,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {1760#false} [191] L94-->L114-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {1760#false} is VALID [2022-04-28 02:02:43,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {1760#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1760#false} is VALID [2022-04-28 02:02:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:43,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497278607] [2022-04-28 02:02:43,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497278607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:43,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:43,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:43,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577769949] [2022-04-28 02:02:43,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:43,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:02:43,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:43,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:43,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:43,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:43,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:43,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:43,963 INFO L87 Difference]: Start difference. First operand 99 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,076 INFO L93 Difference]: Finished difference Result 148 states and 242 transitions. [2022-04-28 02:02:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:44,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:02:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-28 02:02:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-28 02:02:44,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 130 transitions. [2022-04-28 02:02:44,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:44,161 INFO L225 Difference]: With dead ends: 148 [2022-04-28 02:02:44,161 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 02:02:44,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:44,162 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:44,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 80 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 02:02:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-28 02:02:44,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:44,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,166 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,167 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,169 INFO L93 Difference]: Finished difference Result 103 states and 164 transitions. [2022-04-28 02:02:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 164 transitions. [2022-04-28 02:02:44,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:44,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:44,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 02:02:44,170 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 02:02:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,172 INFO L93 Difference]: Finished difference Result 103 states and 164 transitions. [2022-04-28 02:02:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 164 transitions. [2022-04-28 02:02:44,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:44,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:44,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:44,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 97 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2022-04-28 02:02:44,174 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 20 [2022-04-28 02:02:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:44,175 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2022-04-28 02:02:44,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2022-04-28 02:02:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:02:44,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:44,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:44,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:02:44,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash 444052550, now seen corresponding path program 1 times [2022-04-28 02:02:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:44,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343508147] [2022-04-28 02:02:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:44,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {2256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2250#true} is VALID [2022-04-28 02:02:44,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {2250#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2250#true} is VALID [2022-04-28 02:02:44,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2250#true} {2250#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2250#true} is VALID [2022-04-28 02:02:44,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {2250#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:44,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2250#true} is VALID [2022-04-28 02:02:44,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {2250#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2250#true} is VALID [2022-04-28 02:02:44,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2250#true} {2250#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2250#true} is VALID [2022-04-28 02:02:44,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {2250#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2250#true} is VALID [2022-04-28 02:02:44,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {2250#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {2250#true} is VALID [2022-04-28 02:02:44,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {2250#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {2250#true} is VALID [2022-04-28 02:02:44,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {2250#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {2250#true} is VALID [2022-04-28 02:02:44,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {2250#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2250#true} is VALID [2022-04-28 02:02:44,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {2250#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {2250#true} is VALID [2022-04-28 02:02:44,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {2250#true} [169] L57-1-->L61-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2255#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:44,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {2255#(= main_~lk3~0 1)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2255#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:44,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {2255#(= main_~lk3~0 1)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {2255#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:44,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {2255#(= main_~lk3~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {2255#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:44,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {2255#(= main_~lk3~0 1)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2255#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:44,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {2255#(= main_~lk3~0 1)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2255#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:44,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {2255#(= main_~lk3~0 1)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {2255#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:44,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {2255#(= main_~lk3~0 1)} [189] L88-1-->L94: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2255#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:44,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {2255#(= main_~lk3~0 1)} [191] L94-->L114-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2251#false} is VALID [2022-04-28 02:02:44,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {2251#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2251#false} is VALID [2022-04-28 02:02:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:44,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343508147] [2022-04-28 02:02:44,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343508147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:44,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:44,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:44,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076979214] [2022-04-28 02:02:44,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:44,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:02:44,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:44,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:44,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:44,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:44,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:44,235 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,348 INFO L93 Difference]: Finished difference Result 181 states and 297 transitions. [2022-04-28 02:02:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:44,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:02:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 02:02:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 02:02:44,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 02:02:44,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:44,409 INFO L225 Difference]: With dead ends: 181 [2022-04-28 02:02:44,410 INFO L226 Difference]: Without dead ends: 179 [2022-04-28 02:02:44,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:44,410 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:44,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-28 02:02:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 137. [2022-04-28 02:02:44,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:44,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,416 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,416 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,419 INFO L93 Difference]: Finished difference Result 179 states and 292 transitions. [2022-04-28 02:02:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 292 transitions. [2022-04-28 02:02:44,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:44,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:44,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-28 02:02:44,420 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-28 02:02:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,424 INFO L93 Difference]: Finished difference Result 179 states and 292 transitions. [2022-04-28 02:02:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 292 transitions. [2022-04-28 02:02:44,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:44,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:44,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:44,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 133 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 219 transitions. [2022-04-28 02:02:44,427 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 219 transitions. Word has length 20 [2022-04-28 02:02:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:44,427 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 219 transitions. [2022-04-28 02:02:44,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 219 transitions. [2022-04-28 02:02:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:02:44,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:44,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:44,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 02:02:44,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash 247539045, now seen corresponding path program 1 times [2022-04-28 02:02:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:44,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709976106] [2022-04-28 02:02:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:44,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {2970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2964#true} is VALID [2022-04-28 02:02:44,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {2964#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#true} is VALID [2022-04-28 02:02:44,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2964#true} {2964#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#true} is VALID [2022-04-28 02:02:44,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {2964#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:44,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {2970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2964#true} is VALID [2022-04-28 02:02:44,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {2964#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#true} is VALID [2022-04-28 02:02:44,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2964#true} {2964#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#true} is VALID [2022-04-28 02:02:44,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {2964#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2964#true} is VALID [2022-04-28 02:02:44,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {2964#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {2964#true} is VALID [2022-04-28 02:02:44,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {2964#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {2964#true} is VALID [2022-04-28 02:02:44,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {2964#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {2964#true} is VALID [2022-04-28 02:02:44,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {2964#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2964#true} is VALID [2022-04-28 02:02:44,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {2964#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {2964#true} is VALID [2022-04-28 02:02:44,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {2964#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {2969#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:44,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {2969#(= main_~p3~0 0)} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2969#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:44,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {2969#(= main_~p3~0 0)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {2969#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:44,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {2969#(= main_~p3~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {2969#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:44,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {2969#(= main_~p3~0 0)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2969#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:44,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {2969#(= main_~p3~0 0)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2969#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:44,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {2969#(= main_~p3~0 0)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {2969#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:44,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {2969#(= main_~p3~0 0)} [189] L88-1-->L94: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2965#false} is VALID [2022-04-28 02:02:44,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {2965#false} [191] L94-->L114-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2965#false} is VALID [2022-04-28 02:02:44,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {2965#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2965#false} is VALID [2022-04-28 02:02:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:44,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:44,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709976106] [2022-04-28 02:02:44,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709976106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:44,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:44,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049016286] [2022-04-28 02:02:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:02:44,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:44,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:44,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:44,471 INFO L87 Difference]: Start difference. First operand 137 states and 219 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,578 INFO L93 Difference]: Finished difference Result 313 states and 505 transitions. [2022-04-28 02:02:44,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:44,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:02:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-28 02:02:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-28 02:02:44,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-04-28 02:02:44,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:44,671 INFO L225 Difference]: With dead ends: 313 [2022-04-28 02:02:44,671 INFO L226 Difference]: Without dead ends: 187 [2022-04-28 02:02:44,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:44,672 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:44,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-28 02:02:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2022-04-28 02:02:44,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:44,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,678 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,678 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,681 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2022-04-28 02:02:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2022-04-28 02:02:44,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:44,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:44,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 187 states. [2022-04-28 02:02:44,683 INFO L87 Difference]: Start difference. First operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 187 states. [2022-04-28 02:02:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,686 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2022-04-28 02:02:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2022-04-28 02:02:44,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:44,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:44,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:44,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.591160220994475) internal successors, (288), 181 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 291 transitions. [2022-04-28 02:02:44,690 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 291 transitions. Word has length 20 [2022-04-28 02:02:44,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:44,690 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 291 transitions. [2022-04-28 02:02:44,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 291 transitions. [2022-04-28 02:02:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:44,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:44,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:44,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 02:02:44,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash 880759370, now seen corresponding path program 1 times [2022-04-28 02:02:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:44,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525357308] [2022-04-28 02:02:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:44,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {3888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3882#true} is VALID [2022-04-28 02:02:44,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {3882#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3882#true} is VALID [2022-04-28 02:02:44,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3882#true} {3882#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3882#true} is VALID [2022-04-28 02:02:44,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {3882#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:44,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {3888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3882#true} is VALID [2022-04-28 02:02:44,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {3882#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3882#true} is VALID [2022-04-28 02:02:44,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3882#true} {3882#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3882#true} is VALID [2022-04-28 02:02:44,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {3882#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3882#true} is VALID [2022-04-28 02:02:44,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {3882#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {3882#true} is VALID [2022-04-28 02:02:44,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {3882#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {3882#true} is VALID [2022-04-28 02:02:44,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {3882#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {3882#true} is VALID [2022-04-28 02:02:44,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {3882#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3882#true} is VALID [2022-04-28 02:02:44,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {3882#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3882#true} is VALID [2022-04-28 02:02:44,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {3882#true} [169] L57-1-->L61-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {3887#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:44,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {3887#(not (= main_~p3~0 0))} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {3887#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:44,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {3887#(not (= main_~p3~0 0))} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {3887#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:44,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {3887#(not (= main_~p3~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {3887#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:44,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {3887#(not (= main_~p3~0 0))} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3887#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:44,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#(not (= main_~p3~0 0))} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {3887#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:44,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {3887#(not (= main_~p3~0 0))} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {3887#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:44,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {3887#(not (= main_~p3~0 0))} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {3883#false} is VALID [2022-04-28 02:02:44,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {3883#false} [193] L93-1-->L99: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {3883#false} is VALID [2022-04-28 02:02:44,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#false} [195] L99-->L114-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {3883#false} is VALID [2022-04-28 02:02:44,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#false} is VALID [2022-04-28 02:02:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:44,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525357308] [2022-04-28 02:02:44,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525357308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:44,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:44,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:44,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402709649] [2022-04-28 02:02:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:44,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:44,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:44,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:44,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:44,754 INFO L87 Difference]: Start difference. First operand 185 states and 291 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,862 INFO L93 Difference]: Finished difference Result 277 states and 433 transitions. [2022-04-28 02:02:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:44,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 02:02:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 02:02:44,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 02:02:44,941 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-28 02:02:44,943 INFO L225 Difference]: With dead ends: 277 [2022-04-28 02:02:44,943 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 02:02:44,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:44,944 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:44,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 02:02:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-04-28 02:02:44,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:44,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,950 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,950 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,954 INFO L93 Difference]: Finished difference Result 191 states and 292 transitions. [2022-04-28 02:02:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 292 transitions. [2022-04-28 02:02:44,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:44,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:44,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-28 02:02:44,961 INFO L87 Difference]: Start difference. First operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-28 02:02:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:44,965 INFO L93 Difference]: Finished difference Result 191 states and 292 transitions. [2022-04-28 02:02:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 292 transitions. [2022-04-28 02:02:44,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:44,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:44,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:44,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 291 transitions. [2022-04-28 02:02:44,969 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 291 transitions. Word has length 21 [2022-04-28 02:02:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:44,969 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 291 transitions. [2022-04-28 02:02:44,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 291 transitions. [2022-04-28 02:02:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:44,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:44,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:44,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 02:02:44,970 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:44,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:44,971 INFO L85 PathProgramCache]: Analyzing trace with hash -916191989, now seen corresponding path program 1 times [2022-04-28 02:02:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:44,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354997205] [2022-04-28 02:02:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:45,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {4782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4776#true} is VALID [2022-04-28 02:02:45,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {4776#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4776#true} is VALID [2022-04-28 02:02:45,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4776#true} {4776#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4776#true} is VALID [2022-04-28 02:02:45,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {4776#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:45,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {4782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4776#true} is VALID [2022-04-28 02:02:45,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {4776#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4776#true} is VALID [2022-04-28 02:02:45,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4776#true} {4776#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4776#true} is VALID [2022-04-28 02:02:45,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {4776#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4776#true} is VALID [2022-04-28 02:02:45,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {4776#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {4776#true} is VALID [2022-04-28 02:02:45,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {4776#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {4776#true} is VALID [2022-04-28 02:02:45,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {4776#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {4776#true} is VALID [2022-04-28 02:02:45,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {4776#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {4776#true} is VALID [2022-04-28 02:02:45,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {4776#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {4776#true} is VALID [2022-04-28 02:02:45,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {4776#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {4776#true} is VALID [2022-04-28 02:02:45,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {4776#true} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {4781#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:45,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {4781#(= main_~lk4~0 1)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {4781#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:45,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {4781#(= main_~lk4~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {4781#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:45,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {4781#(= main_~lk4~0 1)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {4781#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:45,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {4781#(= main_~lk4~0 1)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {4781#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:45,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {4781#(= main_~lk4~0 1)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {4781#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:45,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {4781#(= main_~lk4~0 1)} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {4781#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:45,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {4781#(= main_~lk4~0 1)} [193] L93-1-->L99: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {4781#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:45,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {4781#(= main_~lk4~0 1)} [195] L99-->L114-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {4777#false} is VALID [2022-04-28 02:02:45,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {4777#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4777#false} is VALID [2022-04-28 02:02:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:45,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354997205] [2022-04-28 02:02:45,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354997205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:45,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:45,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610519602] [2022-04-28 02:02:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:45,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:45,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:45,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:45,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:45,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:45,062 INFO L87 Difference]: Start difference. First operand 189 states and 291 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,168 INFO L93 Difference]: Finished difference Result 333 states and 521 transitions. [2022-04-28 02:02:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 02:02:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 02:02:45,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-28 02:02:45,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:45,231 INFO L225 Difference]: With dead ends: 333 [2022-04-28 02:02:45,231 INFO L226 Difference]: Without dead ends: 331 [2022-04-28 02:02:45,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:45,232 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:45,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:45,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-28 02:02:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-04-28 02:02:45,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:45,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,238 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,239 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,244 INFO L93 Difference]: Finished difference Result 331 states and 512 transitions. [2022-04-28 02:02:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 512 transitions. [2022-04-28 02:02:45,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:45,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:45,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-28 02:02:45,245 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-28 02:02:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,250 INFO L93 Difference]: Finished difference Result 331 states and 512 transitions. [2022-04-28 02:02:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 512 transitions. [2022-04-28 02:02:45,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:45,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:45,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:45,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5172413793103448) internal successors, (396), 261 states have internal predecessors, (396), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2022-04-28 02:02:45,255 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 21 [2022-04-28 02:02:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:45,255 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2022-04-28 02:02:45,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2022-04-28 02:02:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:45,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:45,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:45,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 02:02:45,256 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1112705494, now seen corresponding path program 1 times [2022-04-28 02:02:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:45,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699165067] [2022-04-28 02:02:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:45,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:45,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {6092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6086#true} is VALID [2022-04-28 02:02:45,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {6086#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6086#true} is VALID [2022-04-28 02:02:45,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6086#true} {6086#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6086#true} is VALID [2022-04-28 02:02:45,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {6086#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:45,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {6092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6086#true} is VALID [2022-04-28 02:02:45,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {6086#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6086#true} is VALID [2022-04-28 02:02:45,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6086#true} {6086#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6086#true} is VALID [2022-04-28 02:02:45,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {6086#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6086#true} is VALID [2022-04-28 02:02:45,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {6086#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {6086#true} is VALID [2022-04-28 02:02:45,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {6086#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {6086#true} is VALID [2022-04-28 02:02:45,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {6086#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {6086#true} is VALID [2022-04-28 02:02:45,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {6086#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {6086#true} is VALID [2022-04-28 02:02:45,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {6086#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {6086#true} is VALID [2022-04-28 02:02:45,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {6086#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {6086#true} is VALID [2022-04-28 02:02:45,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {6086#true} [172] L61-1-->L65-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {6091#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:45,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#(= main_~p4~0 0)} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {6091#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:45,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#(= main_~p4~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {6091#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:45,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#(= main_~p4~0 0)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {6091#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:45,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {6091#(= main_~p4~0 0)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {6091#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:45,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {6091#(= main_~p4~0 0)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {6091#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:45,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {6091#(= main_~p4~0 0)} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {6091#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:45,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {6091#(= main_~p4~0 0)} [193] L93-1-->L99: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {6087#false} is VALID [2022-04-28 02:02:45,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {6087#false} [195] L99-->L114-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {6087#false} is VALID [2022-04-28 02:02:45,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {6087#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6087#false} is VALID [2022-04-28 02:02:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:45,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699165067] [2022-04-28 02:02:45,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699165067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:45,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:45,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:45,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35992434] [2022-04-28 02:02:45,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:45,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:45,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:45,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:45,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:45,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:45,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:45,298 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,409 INFO L93 Difference]: Finished difference Result 605 states and 913 transitions. [2022-04-28 02:02:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:45,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-28 02:02:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-28 02:02:45,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 129 transitions. [2022-04-28 02:02:45,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:45,502 INFO L225 Difference]: With dead ends: 605 [2022-04-28 02:02:45,502 INFO L226 Difference]: Without dead ends: 355 [2022-04-28 02:02:45,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:45,503 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:45,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-28 02:02:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-04-28 02:02:45,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:45,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,510 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,510 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,516 INFO L93 Difference]: Finished difference Result 355 states and 520 transitions. [2022-04-28 02:02:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 520 transitions. [2022-04-28 02:02:45,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:45,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:45,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-28 02:02:45,518 INFO L87 Difference]: Start difference. First operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-28 02:02:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,523 INFO L93 Difference]: Finished difference Result 355 states and 520 transitions. [2022-04-28 02:02:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 520 transitions. [2022-04-28 02:02:45,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:45,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:45,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:45,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.478510028653295) internal successors, (516), 349 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 519 transitions. [2022-04-28 02:02:45,530 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 519 transitions. Word has length 21 [2022-04-28 02:02:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:45,530 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 519 transitions. [2022-04-28 02:02:45,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 519 transitions. [2022-04-28 02:02:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:45,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:45,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:45,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 02:02:45,531 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:45,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1662851745, now seen corresponding path program 1 times [2022-04-28 02:02:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:45,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164260066] [2022-04-28 02:02:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:45,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {7826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {7820#true} is VALID [2022-04-28 02:02:45,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {7820#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7820#true} is VALID [2022-04-28 02:02:45,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7820#true} {7820#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7820#true} is VALID [2022-04-28 02:02:45,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {7820#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:45,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {7826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {7820#true} is VALID [2022-04-28 02:02:45,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {7820#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7820#true} is VALID [2022-04-28 02:02:45,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7820#true} {7820#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7820#true} is VALID [2022-04-28 02:02:45,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {7820#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7820#true} is VALID [2022-04-28 02:02:45,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {7820#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {7820#true} is VALID [2022-04-28 02:02:45,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {7820#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {7820#true} is VALID [2022-04-28 02:02:45,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {7820#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {7820#true} is VALID [2022-04-28 02:02:45,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {7820#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {7820#true} is VALID [2022-04-28 02:02:45,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {7820#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {7820#true} is VALID [2022-04-28 02:02:45,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {7820#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {7820#true} is VALID [2022-04-28 02:02:45,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {7820#true} [171] L61-1-->L65-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {7825#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:45,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {7825#(not (= main_~p4~0 0))} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {7825#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:45,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {7825#(not (= main_~p4~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {7825#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:45,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {7825#(not (= main_~p4~0 0))} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {7825#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:45,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {7825#(not (= main_~p4~0 0))} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {7825#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:45,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {7825#(not (= main_~p4~0 0))} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {7825#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:45,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {7825#(not (= main_~p4~0 0))} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {7825#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:45,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {7825#(not (= main_~p4~0 0))} [194] L93-1-->L98-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {7821#false} is VALID [2022-04-28 02:02:45,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {7821#false} [197] L98-1-->L104: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {7821#false} is VALID [2022-04-28 02:02:45,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {7821#false} [199] L104-->L114-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {7821#false} is VALID [2022-04-28 02:02:45,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {7821#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7821#false} is VALID [2022-04-28 02:02:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:45,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:45,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164260066] [2022-04-28 02:02:45,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164260066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:45,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:45,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911334737] [2022-04-28 02:02:45,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:45,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:45,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:45,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:45,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:45,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:45,577 INFO L87 Difference]: Start difference. First operand 353 states and 519 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,696 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2022-04-28 02:02:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-28 02:02:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-28 02:02:45,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-28 02:02:45,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:45,771 INFO L225 Difference]: With dead ends: 529 [2022-04-28 02:02:45,771 INFO L226 Difference]: Without dead ends: 363 [2022-04-28 02:02:45,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:45,772 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:45,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-28 02:02:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-04-28 02:02:45,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:45,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,779 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,780 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,785 INFO L93 Difference]: Finished difference Result 363 states and 520 transitions. [2022-04-28 02:02:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 520 transitions. [2022-04-28 02:02:45,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:45,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:45,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-28 02:02:45,786 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-28 02:02:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,792 INFO L93 Difference]: Finished difference Result 363 states and 520 transitions. [2022-04-28 02:02:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 520 transitions. [2022-04-28 02:02:45,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:45,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:45,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:45,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4453781512605042) internal successors, (516), 357 states have internal predecessors, (516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 519 transitions. [2022-04-28 02:02:45,798 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 519 transitions. Word has length 22 [2022-04-28 02:02:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:45,798 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 519 transitions. [2022-04-28 02:02:45,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 519 transitions. [2022-04-28 02:02:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:45,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:45,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:45,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 02:02:45,799 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash -134099614, now seen corresponding path program 1 times [2022-04-28 02:02:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:45,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109521595] [2022-04-28 02:02:45,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:45,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {9508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {9502#true} is VALID [2022-04-28 02:02:45,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {9502#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9502#true} {9502#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {9502#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:45,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {9508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {9502#true} is VALID [2022-04-28 02:02:45,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {9502#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9502#true} {9502#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {9502#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {9502#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {9502#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {9502#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {9502#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {9502#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {9502#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {9502#true} [172] L61-1-->L65-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {9502#true} is VALID [2022-04-28 02:02:45,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {9502#true} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {9507#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:45,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {9507#(= main_~lk5~0 1)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {9507#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:45,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {9507#(= main_~lk5~0 1)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {9507#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:45,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {9507#(= main_~lk5~0 1)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {9507#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:45,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {9507#(= main_~lk5~0 1)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {9507#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:45,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {9507#(= main_~lk5~0 1)} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {9507#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:45,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {9507#(= main_~lk5~0 1)} [194] L93-1-->L98-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {9507#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:45,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {9507#(= main_~lk5~0 1)} [197] L98-1-->L104: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {9507#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:45,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {9507#(= main_~lk5~0 1)} [199] L104-->L114-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {9503#false} is VALID [2022-04-28 02:02:45,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {9503#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9503#false} is VALID [2022-04-28 02:02:45,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-28 02:02:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:45,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109521595] [2022-04-28 02:02:45,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109521595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:45,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:45,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653079045] [2022-04-28 02:02:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:45,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:45,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:45,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:45,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:45,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:45,840 INFO L87 Difference]: Start difference. First operand 361 states and 519 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:45,938 INFO L93 Difference]: Finished difference Result 621 states and 905 transitions. [2022-04-28 02:02:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-28 02:02:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-28 02:02:45,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-28 02:02:45,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:46,008 INFO L225 Difference]: With dead ends: 621 [2022-04-28 02:02:46,008 INFO L226 Difference]: Without dead ends: 619 [2022-04-28 02:02:46,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:46,009 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:46,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-28 02:02:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-04-28 02:02:46,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:46,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,019 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,020 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,032 INFO L93 Difference]: Finished difference Result 619 states and 888 transitions. [2022-04-28 02:02:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 888 transitions. [2022-04-28 02:02:46,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:46,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:46,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-28 02:02:46,034 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-28 02:02:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,047 INFO L93 Difference]: Finished difference Result 619 states and 888 transitions. [2022-04-28 02:02:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 888 transitions. [2022-04-28 02:02:46,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:46,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:46,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:46,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 517 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 727 transitions. [2022-04-28 02:02:46,058 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 727 transitions. Word has length 22 [2022-04-28 02:02:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:46,058 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 727 transitions. [2022-04-28 02:02:46,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 727 transitions. [2022-04-28 02:02:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:46,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:46,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:46,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 02:02:46,060 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash -330613119, now seen corresponding path program 1 times [2022-04-28 02:02:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:46,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102373568] [2022-04-28 02:02:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {11962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {11956#true} is VALID [2022-04-28 02:02:46,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {11956#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11956#true} {11956#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {11956#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:46,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {11962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {11956#true} is VALID [2022-04-28 02:02:46,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {11956#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11956#true} {11956#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {11956#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {11956#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {11956#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {11956#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {11956#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {11956#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {11956#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {11956#true} [172] L61-1-->L65-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {11956#true} is VALID [2022-04-28 02:02:46,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {11956#true} [174] L65-1-->L69-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {11961#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:46,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {11961#(= main_~p5~0 0)} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {11961#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:46,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {11961#(= main_~p5~0 0)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {11961#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:46,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {11961#(= main_~p5~0 0)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {11961#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:46,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {11961#(= main_~p5~0 0)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {11961#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:46,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {11961#(= main_~p5~0 0)} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {11961#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:46,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {11961#(= main_~p5~0 0)} [194] L93-1-->L98-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {11961#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:46,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {11961#(= main_~p5~0 0)} [197] L98-1-->L104: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {11957#false} is VALID [2022-04-28 02:02:46,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {11957#false} [199] L104-->L114-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {11957#false} is VALID [2022-04-28 02:02:46,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {11957#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11957#false} is VALID [2022-04-28 02:02:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:46,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102373568] [2022-04-28 02:02:46,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102373568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:46,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:46,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114456333] [2022-04-28 02:02:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:46,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:46,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:46,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:46,117 INFO L87 Difference]: Start difference. First operand 521 states and 727 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,257 INFO L93 Difference]: Finished difference Result 1181 states and 1641 transitions. [2022-04-28 02:02:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-28 02:02:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-28 02:02:46,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-28 02:02:46,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:46,341 INFO L225 Difference]: With dead ends: 1181 [2022-04-28 02:02:46,341 INFO L226 Difference]: Without dead ends: 683 [2022-04-28 02:02:46,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:46,342 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:46,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-04-28 02:02:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-04-28 02:02:46,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:46,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,357 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,358 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,372 INFO L93 Difference]: Finished difference Result 683 states and 920 transitions. [2022-04-28 02:02:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 920 transitions. [2022-04-28 02:02:46,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:46,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:46,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 683 states. [2022-04-28 02:02:46,375 INFO L87 Difference]: Start difference. First operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 683 states. [2022-04-28 02:02:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,390 INFO L93 Difference]: Finished difference Result 683 states and 920 transitions. [2022-04-28 02:02:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 920 transitions. [2022-04-28 02:02:46,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:46,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:46,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:46,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.3530280649926145) internal successors, (916), 677 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 919 transitions. [2022-04-28 02:02:46,407 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 919 transitions. Word has length 22 [2022-04-28 02:02:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:46,407 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 919 transitions. [2022-04-28 02:02:46,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 919 transitions. [2022-04-28 02:02:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:46,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:46,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:46,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 02:02:46,408 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 137911718, now seen corresponding path program 1 times [2022-04-28 02:02:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:46,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437387934] [2022-04-28 02:02:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {15296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {15290#true} is VALID [2022-04-28 02:02:46,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {15290#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15290#true} {15290#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {15290#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:46,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {15296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {15290#true} is VALID [2022-04-28 02:02:46,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {15290#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15290#true} {15290#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {15290#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {15290#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {15290#true} is VALID [2022-04-28 02:02:46,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {15290#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {15290#true} is VALID [2022-04-28 02:02:46,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {15290#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {15290#true} is VALID [2022-04-28 02:02:46,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {15290#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {15290#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {15290#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {15290#true} [172] L61-1-->L65-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {15290#true} is VALID [2022-04-28 02:02:46,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {15290#true} [173] L65-1-->L69-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {15295#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:46,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {15295#(not (= main_~p5~0 0))} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {15295#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:46,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {15295#(not (= main_~p5~0 0))} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {15295#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:46,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {15295#(not (= main_~p5~0 0))} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {15295#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:46,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {15295#(not (= main_~p5~0 0))} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {15295#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:46,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {15295#(not (= main_~p5~0 0))} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {15295#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:46,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {15295#(not (= main_~p5~0 0))} [194] L93-1-->L98-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {15295#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:46,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {15295#(not (= main_~p5~0 0))} [198] L98-1-->L103-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {15291#false} is VALID [2022-04-28 02:02:46,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {15291#false} [201] L103-1-->L109: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {15291#false} is VALID [2022-04-28 02:02:46,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {15291#false} [203] L109-->L114-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {15291#false} is VALID [2022-04-28 02:02:46,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {15291#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15291#false} is VALID [2022-04-28 02:02:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:46,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:46,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437387934] [2022-04-28 02:02:46,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437387934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:46,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:46,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105620191] [2022-04-28 02:02:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:46,443 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-28 02:02:46,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:46,443 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-28 02:02:46,454 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-28 02:02:46,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:46,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:46,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:46,455 INFO L87 Difference]: Start difference. First operand 681 states and 919 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-28 02:02:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,569 INFO L93 Difference]: Finished difference Result 1021 states and 1369 transitions. [2022-04-28 02:02:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:46,569 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-28 02:02:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:46,570 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-28 02:02:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-28 02:02:46,572 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-28 02:02:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-28 02:02:46,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-04-28 02:02:46,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:46,654 INFO L225 Difference]: With dead ends: 1021 [2022-04-28 02:02:46,654 INFO L226 Difference]: Without dead ends: 699 [2022-04-28 02:02:46,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:46,656 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:46,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-28 02:02:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-28 02:02:46,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:46,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,671 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,671 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,687 INFO L93 Difference]: Finished difference Result 699 states and 920 transitions. [2022-04-28 02:02:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 920 transitions. [2022-04-28 02:02:46,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:46,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:46,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-28 02:02:46,689 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-28 02:02:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,704 INFO L93 Difference]: Finished difference Result 699 states and 920 transitions. [2022-04-28 02:02:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 920 transitions. [2022-04-28 02:02:46,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:46,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:46,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:46,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.3217893217893217) internal successors, (916), 693 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 919 transitions. [2022-04-28 02:02:46,721 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 919 transitions. Word has length 23 [2022-04-28 02:02:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:46,721 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 919 transitions. [2022-04-28 02:02:46,721 INFO L496 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-28 02:02:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 919 transitions. [2022-04-28 02:02:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:46,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:46,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:46,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 02:02:46,723 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1659039641, now seen corresponding path program 1 times [2022-04-28 02:02:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:46,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151065020] [2022-04-28 02:02:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {18518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {18512#true} is VALID [2022-04-28 02:02:46,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {18512#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18512#true} {18512#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {18512#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:46,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {18518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {18512#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18512#true} {18512#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {18512#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {18512#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {18512#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {18512#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {18512#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {18512#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {18512#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {18512#true} [172] L61-1-->L65-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {18512#true} [174] L65-1-->L69-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {18512#true} is VALID [2022-04-28 02:02:46,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {18512#true} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {18517#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:46,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {18517#(= main_~p6~0 0)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {18517#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:46,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {18517#(= main_~p6~0 0)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {18517#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:46,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {18517#(= main_~p6~0 0)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {18517#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:46,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {18517#(= main_~p6~0 0)} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {18517#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:46,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {18517#(= main_~p6~0 0)} [194] L93-1-->L98-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {18517#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:46,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {18517#(= main_~p6~0 0)} [198] L98-1-->L103-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {18517#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:46,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {18517#(= main_~p6~0 0)} [201] L103-1-->L109: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {18513#false} is VALID [2022-04-28 02:02:46,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {18513#false} [203] L109-->L114-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {18513#false} is VALID [2022-04-28 02:02:46,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {18513#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18513#false} is VALID [2022-04-28 02:02:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151065020] [2022-04-28 02:02:46,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151065020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:46,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:46,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:46,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267638939] [2022-04-28 02:02:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:46,765 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-28 02:02:46,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:46,765 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-28 02:02:46,776 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-28 02:02:46,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:46,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:46,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:46,777 INFO L87 Difference]: Start difference. First operand 697 states and 919 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-28 02:02:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,983 INFO L93 Difference]: Finished difference Result 1981 states and 2553 transitions. [2022-04-28 02:02:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:46,984 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-28 02:02:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:46,984 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-28 02:02:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-28 02:02:46,985 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-28 02:02:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-28 02:02:46,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-28 02:02:47,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:47,108 INFO L225 Difference]: With dead ends: 1981 [2022-04-28 02:02:47,108 INFO L226 Difference]: Without dead ends: 1323 [2022-04-28 02:02:47,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:47,110 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:47,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-04-28 02:02:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-04-28 02:02:47,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:47,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:47,139 INFO L74 IsIncluded]: Start isIncluded. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:47,140 INFO L87 Difference]: Start difference. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,184 INFO L93 Difference]: Finished difference Result 1323 states and 1640 transitions. [2022-04-28 02:02:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1640 transitions. [2022-04-28 02:02:47,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1323 states. [2022-04-28 02:02:47,189 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1323 states. [2022-04-28 02:02:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,234 INFO L93 Difference]: Finished difference Result 1323 states and 1640 transitions. [2022-04-28 02:02:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1640 transitions. [2022-04-28 02:02:47,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:47,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2422171602126044) internal successors, (1636), 1317 states have internal predecessors, (1636), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1639 transitions. [2022-04-28 02:02:47,283 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1639 transitions. Word has length 23 [2022-04-28 02:02:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:47,283 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1639 transitions. [2022-04-28 02:02:47,283 INFO L496 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-28 02:02:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1639 transitions. [2022-04-28 02:02:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:47,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:47,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:47,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 02:02:47,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1462526136, now seen corresponding path program 1 times [2022-04-28 02:02:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:47,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991709895] [2022-04-28 02:02:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:47,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {24652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24646#true} is VALID [2022-04-28 02:02:47,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {24646#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24646#true} {24646#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {24646#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:47,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {24652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24646#true} is VALID [2022-04-28 02:02:47,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {24646#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24646#true} {24646#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {24646#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {24646#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {24646#true} is VALID [2022-04-28 02:02:47,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {24646#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {24646#true} is VALID [2022-04-28 02:02:47,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {24646#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {24646#true} is VALID [2022-04-28 02:02:47,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {24646#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {24646#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {24646#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {24646#true} [172] L61-1-->L65-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {24646#true} [174] L65-1-->L69-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {24646#true} is VALID [2022-04-28 02:02:47,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {24646#true} [175] L69-1-->L73-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {24651#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:47,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {24651#(= main_~lk6~0 1)} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {24651#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:47,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {24651#(= main_~lk6~0 1)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {24651#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:47,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {24651#(= main_~lk6~0 1)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {24651#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:47,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {24651#(= main_~lk6~0 1)} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {24651#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:47,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {24651#(= main_~lk6~0 1)} [194] L93-1-->L98-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {24651#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:47,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {24651#(= main_~lk6~0 1)} [198] L98-1-->L103-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {24651#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:47,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {24651#(= main_~lk6~0 1)} [201] L103-1-->L109: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {24651#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:47,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {24651#(= main_~lk6~0 1)} [203] L109-->L114-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {24647#false} is VALID [2022-04-28 02:02:47,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {24647#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24647#false} is VALID [2022-04-28 02:02:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:47,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991709895] [2022-04-28 02:02:47,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991709895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:47,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:47,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858136494] [2022-04-28 02:02:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:47,342 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-28 02:02:47,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:47,342 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-28 02:02:47,353 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-28 02:02:47,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:47,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:47,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:47,354 INFO L87 Difference]: Start difference. First operand 1321 states and 1639 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-28 02:02:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,494 INFO L93 Difference]: Finished difference Result 1453 states and 1833 transitions. [2022-04-28 02:02:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:47,494 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-28 02:02:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:47,494 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-28 02:02:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-04-28 02:02:47,495 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-28 02:02:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-04-28 02:02:47,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2022-04-28 02:02:47,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:47,592 INFO L225 Difference]: With dead ends: 1453 [2022-04-28 02:02:47,592 INFO L226 Difference]: Without dead ends: 1451 [2022-04-28 02:02:47,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:47,593 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:47,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 76 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-28 02:02:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1321. [2022-04-28 02:02:47,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:47,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:47,615 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:47,616 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,668 INFO L93 Difference]: Finished difference Result 1451 states and 1800 transitions. [2022-04-28 02:02:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1800 transitions. [2022-04-28 02:02:47,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-28 02:02:47,672 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-28 02:02:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,720 INFO L93 Difference]: Finished difference Result 1451 states and 1800 transitions. [2022-04-28 02:02:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1800 transitions. [2022-04-28 02:02:47,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:47,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2179195140470767) internal successors, (1604), 1317 states have internal predecessors, (1604), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1607 transitions. [2022-04-28 02:02:47,767 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1607 transitions. Word has length 23 [2022-04-28 02:02:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:47,767 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1607 transitions. [2022-04-28 02:02:47,767 INFO L496 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-28 02:02:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1607 transitions. [2022-04-28 02:02:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:02:47,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:47,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:47,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 02:02:47,769 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash 109411261, now seen corresponding path program 1 times [2022-04-28 02:02:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:47,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074961236] [2022-04-28 02:02:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {30514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30508#true} is VALID [2022-04-28 02:02:47,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {30508#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30508#true} {30508#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {30508#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:47,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {30514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30508#true} is VALID [2022-04-28 02:02:47,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {30508#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30508#true} {30508#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {30508#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {30508#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {30508#true} is VALID [2022-04-28 02:02:47,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {30508#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {30508#true} is VALID [2022-04-28 02:02:47,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {30508#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {30508#true} is VALID [2022-04-28 02:02:47,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {30508#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {30508#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {30508#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {30508#true} [172] L61-1-->L65-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {30508#true} [174] L65-1-->L69-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {30508#true} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {30508#true} is VALID [2022-04-28 02:02:47,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {30508#true} [177] L73-1-->L77-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {30513#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:47,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {30513#(= main_~lk7~0 1)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {30513#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:47,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {30513#(= main_~lk7~0 1)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {30513#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:47,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {30513#(= main_~lk7~0 1)} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {30513#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:47,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {30513#(= main_~lk7~0 1)} [194] L93-1-->L98-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {30513#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:47,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {30513#(= main_~lk7~0 1)} [198] L98-1-->L103-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {30513#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:47,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {30513#(= main_~lk7~0 1)} [202] L103-1-->L108-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {30513#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:47,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {30513#(= main_~lk7~0 1)} [205] L108-1-->L114: Formula: (not (= v_main_~p7~0_1 0)) InVars {main_~p7~0=v_main_~p7~0_1} OutVars{main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[] {30513#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:47,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {30513#(= main_~lk7~0 1)} [207] L114-->L114-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {30509#false} is VALID [2022-04-28 02:02:47,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {30509#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30509#false} is VALID [2022-04-28 02:02:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:47,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074961236] [2022-04-28 02:02:47,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074961236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:47,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:47,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:47,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177915627] [2022-04-28 02:02:47,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:47,800 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-28 02:02:47,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:47,800 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-28 02:02:47,812 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-28 02:02:47,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:47,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:47,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:47,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:47,812 INFO L87 Difference]: Start difference. First operand 1321 states and 1607 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-28 02:02:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,028 INFO L93 Difference]: Finished difference Result 2155 states and 2600 transitions. [2022-04-28 02:02:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:48,028 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-28 02:02:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:48,028 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-28 02:02:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 02:02:48,029 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-28 02:02:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 02:02:48,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-28 02:02:48,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:48,195 INFO L225 Difference]: With dead ends: 2155 [2022-04-28 02:02:48,195 INFO L226 Difference]: Without dead ends: 2153 [2022-04-28 02:02:48,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:48,196 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:48,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2022-04-28 02:02:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2025. [2022-04-28 02:02:48,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:48,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2153 states. Second operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:48,225 INFO L74 IsIncluded]: Start isIncluded. First operand 2153 states. Second operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:48,226 INFO L87 Difference]: Start difference. First operand 2153 states. Second operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,333 INFO L93 Difference]: Finished difference Result 2153 states and 2535 transitions. [2022-04-28 02:02:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 2535 transitions. [2022-04-28 02:02:48,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:48,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:48,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2153 states. [2022-04-28 02:02:48,339 INFO L87 Difference]: Start difference. First operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2153 states. [2022-04-28 02:02:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,446 INFO L93 Difference]: Finished difference Result 2153 states and 2535 transitions. [2022-04-28 02:02:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 2535 transitions. [2022-04-28 02:02:48,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:48,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:48,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:48,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 2021 states have (on average 1.1895101434933202) internal successors, (2404), 2021 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2407 transitions. [2022-04-28 02:02:48,552 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2407 transitions. Word has length 24 [2022-04-28 02:02:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:48,552 INFO L495 AbstractCegarLoop]: Abstraction has 2025 states and 2407 transitions. [2022-04-28 02:02:48,553 INFO L496 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-28 02:02:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2407 transitions. [2022-04-28 02:02:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:02:48,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:48,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:48,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 02:02:48,555 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:48,555 INFO L85 PathProgramCache]: Analyzing trace with hash -87102244, now seen corresponding path program 1 times [2022-04-28 02:02:48,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:48,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6718720] [2022-04-28 02:02:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {39217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {39211#true} is VALID [2022-04-28 02:02:48,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {39211#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39211#true} {39211#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {39211#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:48,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {39217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {39211#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39211#true} {39211#true} [209] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {39211#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {39211#true} [156] mainENTRY-->L113-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p7~0_2 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p6~0=v_main_~p6~0_2, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~lk7~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0, main_#t~nondet10, main_~p7~0] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {39211#true} [160] L113-1-->L34: Formula: (and (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet11_2| v_main_~cond~0_2) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet11, main_~cond~0] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {39211#true} [163] L34-->L53: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk7~0] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {39211#true} [166] L53-->L53-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {39211#true} [168] L53-2-->L57-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {39211#true} [170] L57-1-->L61-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {39211#true} [172] L61-1-->L65-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {39211#true} [174] L65-1-->L69-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {39211#true} [176] L69-1-->L73-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {39211#true} is VALID [2022-04-28 02:02:48,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {39211#true} [178] L73-1-->L77-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {39216#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:48,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {39216#(= main_~p7~0 0)} [180] L77-1-->L83-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {39216#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:48,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {39216#(= main_~p7~0 0)} [184] L83-1-->L88-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {39216#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:48,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {39216#(= main_~p7~0 0)} [190] L88-1-->L93-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {39216#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:48,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {39216#(= main_~p7~0 0)} [194] L93-1-->L98-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {39216#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:48,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {39216#(= main_~p7~0 0)} [198] L98-1-->L103-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {39216#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:48,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {39216#(= main_~p7~0 0)} [202] L103-1-->L108-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {39216#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:48,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {39216#(= main_~p7~0 0)} [205] L108-1-->L114: Formula: (not (= v_main_~p7~0_1 0)) InVars {main_~p7~0=v_main_~p7~0_1} OutVars{main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[] {39212#false} is VALID [2022-04-28 02:02:48,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {39212#false} [207] L114-->L114-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {39212#false} is VALID [2022-04-28 02:02:48,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {39212#false} [185] L114-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39212#false} is VALID [2022-04-28 02:02:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:48,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6718720] [2022-04-28 02:02:48,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6718720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:48,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:48,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790746288] [2022-04-28 02:02:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:48,585 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-28 02:02:48,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:48,585 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-28 02:02:48,596 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-28 02:02:48,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:48,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:48,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:48,596 INFO L87 Difference]: Start difference. First operand 2025 states and 2407 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-28 02:02:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,187 INFO L93 Difference]: Finished difference Result 4521 states and 5287 transitions. [2022-04-28 02:02:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:49,188 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-28 02:02:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:49,188 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-28 02:02:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 02:02:49,189 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-28 02:02:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 02:02:49,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-28 02:02:49,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,259 INFO L225 Difference]: With dead ends: 4521 [2022-04-28 02:02:49,259 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:02:49,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:49,264 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:49,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:02:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:02:49,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:49,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:02:49,265 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:02:49,265 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:02:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,265 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:02:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:02:49,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 02:02:49,265 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 02:02:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,265 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:02:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:02:49,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:49,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:02:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:02:49,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 02:02:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:49,266 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:02:49,266 INFO L496 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-28 02:02:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:02:49,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:02:49,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 02:02:49,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:02:51,602 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 02:02:51,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:02:51,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:02:51,603 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:02:51,603 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:02:51,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:02:51,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:02:51,603 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-04-28 02:02:51,603 INFO L902 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-04-28 02:02:51,603 INFO L902 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-04-28 02:02:51,603 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-04-28 02:02:51,603 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 123) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 123) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L77-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L895 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-04-28 02:02:51,604 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L98-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 118) no Hoare annotation was computed. [2022-04-28 02:02:51,605 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-04-28 02:02:51,607 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:51,609 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 02:02:51,611 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-28 02:02:51,612 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-28 02:02:51,613 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-28 02:02:51,613 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:02:51,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:02:51 BasicIcfg [2022-04-28 02:02:51,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:02:51,618 INFO L158 Benchmark]: Toolchain (without parser) took 10454.37ms. Allocated memory was 185.6MB in the beginning and 415.2MB in the end (delta: 229.6MB). Free memory was 128.8MB in the beginning and 304.9MB in the end (delta: -176.2MB). Peak memory consumption was 227.9MB. Max. memory is 8.0GB. [2022-04-28 02:02:51,618 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:02:51,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.76ms. Allocated memory was 185.6MB in the beginning and 276.8MB in the end (delta: 91.2MB). Free memory was 128.6MB in the beginning and 246.7MB in the end (delta: -118.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-28 02:02:51,625 INFO L158 Benchmark]: Boogie Preprocessor took 42.09ms. Allocated memory is still 276.8MB. Free memory was 246.7MB in the beginning and 245.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:02:51,625 INFO L158 Benchmark]: RCFGBuilder took 255.34ms. Allocated memory is still 276.8MB. Free memory was 245.1MB in the beginning and 232.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 02:02:51,625 INFO L158 Benchmark]: IcfgTransformer took 57.31ms. Allocated memory is still 276.8MB. Free memory was 232.0MB in the beginning and 230.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:02:51,625 INFO L158 Benchmark]: TraceAbstraction took 9838.37ms. Allocated memory was 276.8MB in the beginning and 415.2MB in the end (delta: 138.4MB). Free memory was 229.9MB in the beginning and 304.9MB in the end (delta: -75.0MB). Peak memory consumption was 238.0MB. Max. memory is 8.0GB. [2022-04-28 02:02:51,626 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.76ms. Allocated memory was 185.6MB in the beginning and 276.8MB in the end (delta: 91.2MB). Free memory was 128.6MB in the beginning and 246.7MB in the end (delta: -118.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.09ms. Allocated memory is still 276.8MB. Free memory was 246.7MB in the beginning and 245.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.34ms. Allocated memory is still 276.8MB. Free memory was 245.1MB in the beginning and 232.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 57.31ms. Allocated memory is still 276.8MB. Free memory was 232.0MB in the beginning and 230.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 9838.37ms. Allocated memory was 276.8MB in the beginning and 415.2MB in the end (delta: 138.4MB). Free memory was 229.9MB in the beginning and 304.9MB in the end (delta: -75.0MB). Peak memory consumption was 238.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1713 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1713 mSDsluCounter, 1337 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 836 IncrementalHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1202 mSDtfsCounter, 836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2025occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-04-28 02:02:51,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...