/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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:02:54,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:02:54,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:02:54,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:02:54,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:02:54,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:02:54,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:02:54,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:02:54,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:02:54,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:02:54,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:02:54,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:02:54,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:02:54,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:02:54,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:02:54,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:02:54,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:02:54,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:02:54,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:02:54,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:02:54,202 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:02:54,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:02:54,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:02:54,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:02:54,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:02:54,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:02:54,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:02:54,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:02:54,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:02:54,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:02:54,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:02:54,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:02:54,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:02:54,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:02:54,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:02:54,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:02:54,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:02:54,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:02:54,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:02:54,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:02:54,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:02:54,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:02:54,214 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:54,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:02:54,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:02:54,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 02:02:54,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 02:02:54,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 02:02:54,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 02:02:54,238 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 02:02:54,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:02:54,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:02:54,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:02:54,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:02:54,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:02:54,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:02:54,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:02:54,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:02:54,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:02:54,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:02:54,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:02:54,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:02:54,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:02:54,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:02:54,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 02:02:54,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 02:02:54,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 02:02:54,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 02:02:54,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:02:54,241 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 02:02:54,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 02:02:54,242 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 02:02:54,242 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:54,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:02:54,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:02:54,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:02:54,447 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:02:54,448 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:02:54,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-04-28 02:02:54,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244bc50f6/31aa5227604e4e57b844b91c4a9c6c5f/FLAGc5d77dfb5 [2022-04-28 02:02:54,778 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:02:54,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-04-28 02:02:54,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244bc50f6/31aa5227604e4e57b844b91c4a9c6c5f/FLAGc5d77dfb5 [2022-04-28 02:02:55,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244bc50f6/31aa5227604e4e57b844b91c4a9c6c5f [2022-04-28 02:02:55,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:02:55,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 02:02:55,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:02:55,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:02:55,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:02:55,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:02:55" (1/1) ... [2022-04-28 02:02:55,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd2688b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:55, skipping insertion in model container [2022-04-28 02:02:55,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:02:55" (1/1) ... [2022-04-28 02:02:55,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:02:55,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:02:55,350 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_9.c[3555,3568] [2022-04-28 02:02:55,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:02:55,357 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:02:55,373 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_9.c[3555,3568] [2022-04-28 02:02:55,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:02:55,382 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:02:55,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:55 WrapperNode [2022-04-28 02:02:55,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:02:55,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:02:55,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:02:55,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:02:55,397 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:55" (1/1) ... [2022-04-28 02:02:55,398 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:55" (1/1) ... [2022-04-28 02:02:55,402 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:55" (1/1) ... [2022-04-28 02:02:55,402 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:55" (1/1) ... [2022-04-28 02:02:55,406 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:55" (1/1) ... [2022-04-28 02:02:55,418 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:55" (1/1) ... [2022-04-28 02:02:55,419 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:55" (1/1) ... [2022-04-28 02:02:55,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:02:55,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:02:55,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:02:55,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:02:55,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:55" (1/1) ... [2022-04-28 02:02:55,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:02:55,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:02:55,449 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:55,450 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:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:02:55,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:02:55,480 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:02:55,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:02:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:02:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:02:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:02:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:02:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:02:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:02:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:02:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:02:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:02:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:02:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:02:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:02:55,534 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:02:55,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:02:55,714 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:02:55,719 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:02:55,719 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:02:55,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:55 BoogieIcfgContainer [2022-04-28 02:02:55,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:02:55,721 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 02:02:55,721 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 02:02:55,721 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 02:02:55,723 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:55" (1/1) ... [2022-04-28 02:02:55,725 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 02:02:55,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:02:55 BasicIcfg [2022-04-28 02:02:55,777 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 02:02:55,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:02:55,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:02:55,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:02:55,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:02:55" (1/4) ... [2022-04-28 02:02:55,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330e428d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:02:55, skipping insertion in model container [2022-04-28 02:02:55,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:55" (2/4) ... [2022-04-28 02:02:55,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330e428d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:02:55, skipping insertion in model container [2022-04-28 02:02:55,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:55" (3/4) ... [2022-04-28 02:02:55,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330e428d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:02:55, skipping insertion in model container [2022-04-28 02:02:55,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:02:55" (4/4) ... [2022-04-28 02:02:55,788 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.cqvasr [2022-04-28 02:02:55,796 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:02:55,797 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:02:55,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:02:55,854 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@6c7bfd8e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bf9d33f [2022-04-28 02:02:55,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:02:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 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:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:02:55,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:55,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:55,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -311393162, now seen corresponding path program 1 times [2022-04-28 02:02:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:55,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743602183] [2022-04-28 02:02:55,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:56,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:56,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {45#true} is VALID [2022-04-28 02:02:56,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-28 02:02:56,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-28 02:02:56,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {45#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:56,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {45#true} is VALID [2022-04-28 02:02:56,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-28 02:02:56,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-28 02:02:56,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {45#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-28 02:02:56,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {45#true} is VALID [2022-04-28 02:02:56,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {45#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {45#true} is VALID [2022-04-28 02:02:56,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {45#true} is VALID [2022-04-28 02:02:56,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#true} [199] L63-->L63-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#(= main_~lk1~0 1)} [201] L63-2-->L67-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {50#(= main_~lk1~0 1)} [203] L67-1-->L71-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {50#(= main_~lk1~0 1)} [205] L71-1-->L75-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {50#(= main_~lk1~0 1)} [208] L75-1-->L79-1: Formula: (= 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[] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {50#(= main_~lk1~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {50#(= main_~lk1~0 1)} [211] L83-1-->L87-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {50#(= main_~lk1~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {50#(= main_~lk1~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {50#(= main_~lk1~0 1)} [217] L95-1-->L102: 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[] {50#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:56,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {50#(= main_~lk1~0 1)} [219] L102-->L142-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[] {46#false} is VALID [2022-04-28 02:02:56,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#false} is VALID [2022-04-28 02:02:56,076 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:56,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:56,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743602183] [2022-04-28 02:02:56,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743602183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:56,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:56,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815772244] [2022-04-28 02:02:56,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:56,082 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:56,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:56,085 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:56,103 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:56,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:56,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:56,120 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 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 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:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:56,339 INFO L93 Difference]: Finished difference Result 82 states and 139 transitions. [2022-04-28 02:02:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:56,340 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:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:56,341 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:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 02:02:56,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:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 02:02:56,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 02:02:56,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:56,493 INFO L225 Difference]: With dead ends: 82 [2022-04-28 02:02:56,493 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 02:02:56,496 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:56,500 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:56,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 83 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:02:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 02:02:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-28 02:02:56,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:56,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have 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:56,534 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have 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:56,535 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have 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:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:56,544 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-28 02:02:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-28 02:02:56,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:56,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:56,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 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 67 states. [2022-04-28 02:02:56,548 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 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 67 states. [2022-04-28 02:02:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:56,554 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-28 02:02:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-28 02:02:56,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:56,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:56,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:56,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have 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:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2022-04-28 02:02:56,571 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2022-04-28 02:02:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:56,572 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2022-04-28 02:02:56,572 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:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2022-04-28 02:02:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:02:56,572 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:56,573 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:56,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:02:56,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:56,573 INFO L85 PathProgramCache]: Analyzing trace with hash -182310443, now seen corresponding path program 1 times [2022-04-28 02:02:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:56,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736306620] [2022-04-28 02:02:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:56,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:56,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {338#true} is VALID [2022-04-28 02:02:56,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-28 02:02:56,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338#true} {338#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-28 02:02:56,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {338#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:56,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {338#true} is VALID [2022-04-28 02:02:56,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {338#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-28 02:02:56,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338#true} {338#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-28 02:02:56,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {338#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-28 02:02:56,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {338#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {338#true} is VALID [2022-04-28 02:02:56,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {338#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {338#true} is VALID [2022-04-28 02:02:56,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {338#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {338#true} is VALID [2022-04-28 02:02:56,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#true} [200] L63-->L63-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[] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(= main_~p1~0 0)} [201] L63-2-->L67-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] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#(= main_~p1~0 0)} [203] L67-1-->L71-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] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {343#(= main_~p1~0 0)} [205] L71-1-->L75-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] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#(= main_~p1~0 0)} [208] L75-1-->L79-1: Formula: (= 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[] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {343#(= main_~p1~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {343#(= main_~p1~0 0)} [211] L83-1-->L87-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] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {343#(= main_~p1~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {343#(= main_~p1~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {343#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:56,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {343#(= main_~p1~0 0)} [217] L95-1-->L102: 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[] {339#false} is VALID [2022-04-28 02:02:56,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {339#false} [219] L102-->L142-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[] {339#false} is VALID [2022-04-28 02:02:56,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {339#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {339#false} is VALID [2022-04-28 02:02:56,688 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:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:56,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736306620] [2022-04-28 02:02:56,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736306620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:56,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:56,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298040007] [2022-04-28 02:02:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:56,690 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:56,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:56,691 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:56,704 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:56,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:56,708 INFO L87 Difference]: Start difference. First operand 47 states and 82 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:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:56,895 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2022-04-28 02:02:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:56,895 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:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:56,896 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:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 02:02:56,900 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:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 02:02:56,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-28 02:02:57,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:57,045 INFO L225 Difference]: With dead ends: 108 [2022-04-28 02:02:57,046 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 02:02:57,046 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:57,048 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:57,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 02:02:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-28 02:02:57,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:57,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:57,061 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:57,062 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,065 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-28 02:02:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-28 02:02:57,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:57,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:57,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 02:02:57,070 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 02:02:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,075 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-28 02:02:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-28 02:02:57,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:57,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:57,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:57,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-04-28 02:02:57,079 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2022-04-28 02:02:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:57,079 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-04-28 02:02:57,080 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:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-04-28 02:02:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:57,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:57,081 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:57,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:02:57,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1063221432, now seen corresponding path program 1 times [2022-04-28 02:02:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:57,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787747964] [2022-04-28 02:02:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:57,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:57,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {674#true} is VALID [2022-04-28 02:02:57,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {674#true} is VALID [2022-04-28 02:02:57,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {674#true} {674#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {674#true} is VALID [2022-04-28 02:02:57,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {674#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:57,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {674#true} is VALID [2022-04-28 02:02:57,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {674#true} is VALID [2022-04-28 02:02:57,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#true} {674#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {674#true} is VALID [2022-04-28 02:02:57,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {674#true} is VALID [2022-04-28 02:02:57,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {674#true} is VALID [2022-04-28 02:02:57,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {674#true} is VALID [2022-04-28 02:02:57,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {674#true} is VALID [2022-04-28 02:02:57,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#true} [199] L63-->L63-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] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(not (= main_~p1~0 0))} [201] L63-2-->L67-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] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {679#(not (= main_~p1~0 0))} [203] L67-1-->L71-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] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {679#(not (= main_~p1~0 0))} [205] L71-1-->L75-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] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {679#(not (= main_~p1~0 0))} [208] L75-1-->L79-1: Formula: (= 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[] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {679#(not (= main_~p1~0 0))} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {679#(not (= main_~p1~0 0))} [211] L83-1-->L87-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] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {679#(not (= main_~p1~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {679#(not (= main_~p1~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {679#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:57,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {679#(not (= main_~p1~0 0))} [218] L95-1-->L101-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[] {675#false} is VALID [2022-04-28 02:02:57,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {675#false} [221] L101-1-->L107: 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[] {675#false} is VALID [2022-04-28 02:02:57,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {675#false} [225] L107-->L142-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[] {675#false} is VALID [2022-04-28 02:02:57,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {675#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#false} is VALID [2022-04-28 02:02:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787747964] [2022-04-28 02:02:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787747964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:57,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:57,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360586031] [2022-04-28 02:02:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:57,181 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:57,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:57,181 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:57,193 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:57,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:57,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:57,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:57,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:57,194 INFO L87 Difference]: Start difference. First operand 65 states and 114 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:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,331 INFO L93 Difference]: Finished difference Result 100 states and 172 transitions. [2022-04-28 02:02:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:57,331 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:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:57,331 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:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 02:02:57,333 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:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 02:02:57,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-28 02:02:57,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:57,437 INFO L225 Difference]: With dead ends: 100 [2022-04-28 02:02:57,437 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 02:02:57,439 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:57,443 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:57,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 103 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 02:02:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-28 02:02:57,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:57,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have 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:57,453 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have 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:57,453 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have 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:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,455 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-28 02:02:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-28 02:02:57,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:57,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:57,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 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 70 states. [2022-04-28 02:02:57,456 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 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 70 states. [2022-04-28 02:02:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,459 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-28 02:02:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-28 02:02:57,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:57,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:57,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:57,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have 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:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2022-04-28 02:02:57,461 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2022-04-28 02:02:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:57,461 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2022-04-28 02:02:57,461 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:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2022-04-28 02:02:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:57,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:57,462 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:57,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:02:57,462 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1356624439, now seen corresponding path program 1 times [2022-04-28 02:02:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:57,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776022956] [2022-04-28 02:02:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:57,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {1019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {1013#true} is VALID [2022-04-28 02:02:57,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1013#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-28 02:02:57,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1013#true} {1013#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-28 02:02:57,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {1013#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:57,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {1013#true} is VALID [2022-04-28 02:02:57,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {1013#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-28 02:02:57,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1013#true} {1013#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-28 02:02:57,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {1013#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-28 02:02:57,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {1013#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1013#true} is VALID [2022-04-28 02:02:57,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {1013#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {1013#true} is VALID [2022-04-28 02:02:57,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {1013#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {1013#true} is VALID [2022-04-28 02:02:57,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {1013#true} [200] L63-->L63-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[] {1013#true} is VALID [2022-04-28 02:02:57,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {1013#true} [201] L63-2-->L67-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] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {1018#(= main_~lk2~0 1)} [203] L67-1-->L71-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] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#(= main_~lk2~0 1)} [205] L71-1-->L75-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] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {1018#(= main_~lk2~0 1)} [208] L75-1-->L79-1: Formula: (= 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[] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {1018#(= main_~lk2~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {1018#(= main_~lk2~0 1)} [211] L83-1-->L87-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] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#(= main_~lk2~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#(= main_~lk2~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#(= main_~lk2~0 1)} [218] L95-1-->L101-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[] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {1018#(= main_~lk2~0 1)} [221] L101-1-->L107: 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[] {1018#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:57,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {1018#(= main_~lk2~0 1)} [225] L107-->L142-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[] {1014#false} is VALID [2022-04-28 02:02:57,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {1014#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1014#false} is VALID [2022-04-28 02:02:57,542 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:57,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:57,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776022956] [2022-04-28 02:02:57,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776022956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:57,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:57,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362266862] [2022-04-28 02:02:57,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:57,543 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:57,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:57,544 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:57,558 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:57,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:57,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:57,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:57,563 INFO L87 Difference]: Start difference. First operand 68 states and 116 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:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,707 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2022-04-28 02:02:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:57,707 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:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:57,707 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:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 02:02:57,708 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:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 02:02:57,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 02:02:57,787 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:57,789 INFO L225 Difference]: With dead ends: 125 [2022-04-28 02:02:57,789 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 02:02:57,789 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:57,790 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:57,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 02:02:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2022-04-28 02:02:57,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:57,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have 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:57,794 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have 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:57,795 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have 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:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,798 INFO L93 Difference]: Finished difference Result 123 states and 214 transitions. [2022-04-28 02:02:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 214 transitions. [2022-04-28 02:02:57,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:57,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:57,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 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 123 states. [2022-04-28 02:02:57,799 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 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 123 states. [2022-04-28 02:02:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,802 INFO L93 Difference]: Finished difference Result 123 states and 214 transitions. [2022-04-28 02:02:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 214 transitions. [2022-04-28 02:02:57,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:57,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:57,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:57,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have 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:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 153 transitions. [2022-04-28 02:02:57,804 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 153 transitions. Word has length 21 [2022-04-28 02:02:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:57,804 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 153 transitions. [2022-04-28 02:02:57,804 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:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 153 transitions. [2022-04-28 02:02:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:57,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:57,805 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:57,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:02:57,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1227541720, now seen corresponding path program 1 times [2022-04-28 02:02:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:57,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215904201] [2022-04-28 02:02:57,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:57,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {1511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {1505#true} is VALID [2022-04-28 02:02:57,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#true} is VALID [2022-04-28 02:02:57,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1505#true} {1505#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#true} is VALID [2022-04-28 02:02:57,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1505#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:57,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {1505#true} is VALID [2022-04-28 02:02:57,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1505#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#true} is VALID [2022-04-28 02:02:57,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1505#true} {1505#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#true} is VALID [2022-04-28 02:02:57,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {1505#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#true} is VALID [2022-04-28 02:02:57,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1505#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1505#true} is VALID [2022-04-28 02:02:57,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {1505#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {1505#true} is VALID [2022-04-28 02:02:57,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {1505#true} is VALID [2022-04-28 02:02:57,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {1505#true} [200] L63-->L63-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[] {1505#true} is VALID [2022-04-28 02:02:57,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {1505#true} [202] L63-2-->L67-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[] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {1510#(= main_~p2~0 0)} [203] L67-1-->L71-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] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {1510#(= main_~p2~0 0)} [205] L71-1-->L75-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] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1510#(= main_~p2~0 0)} [208] L75-1-->L79-1: Formula: (= 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[] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1510#(= main_~p2~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1510#(= main_~p2~0 0)} [211] L83-1-->L87-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] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1510#(= main_~p2~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {1510#(= main_~p2~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {1510#(= main_~p2~0 0)} [218] L95-1-->L101-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[] {1510#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:57,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {1510#(= main_~p2~0 0)} [221] L101-1-->L107: 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[] {1506#false} is VALID [2022-04-28 02:02:57,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {1506#false} [225] L107-->L142-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[] {1506#false} is VALID [2022-04-28 02:02:57,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {1506#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1506#false} is VALID [2022-04-28 02:02:57,842 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:57,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:57,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215904201] [2022-04-28 02:02:57,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215904201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:57,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:57,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893861870] [2022-04-28 02:02:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:57,843 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:57,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:57,843 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:57,859 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:57,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:57,860 INFO L87 Difference]: Start difference. First operand 89 states and 153 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:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,999 INFO L93 Difference]: Finished difference Result 205 states and 359 transitions. [2022-04-28 02:02:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:57,999 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:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:57,999 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:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 02:02:58,001 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:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 02:02:58,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-28 02:02:58,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:58,101 INFO L225 Difference]: With dead ends: 205 [2022-04-28 02:02:58,101 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 02:02:58,102 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:58,102 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:58,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 02:02:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-28 02:02:58,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:58,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have 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:58,107 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have 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:58,108 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have 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:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,110 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2022-04-28 02:02:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 212 transitions. [2022-04-28 02:02:58,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:58,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:58,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 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 125 states. [2022-04-28 02:02:58,111 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 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 125 states. [2022-04-28 02:02:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,113 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2022-04-28 02:02:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 212 transitions. [2022-04-28 02:02:58,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:58,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:58,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:58,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have 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:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2022-04-28 02:02:58,116 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2022-04-28 02:02:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:58,116 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2022-04-28 02:02:58,117 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:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2022-04-28 02:02:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:58,117 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:58,117 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:58,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:02:58,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:58,117 INFO L85 PathProgramCache]: Analyzing trace with hash 894347473, now seen corresponding path program 1 times [2022-04-28 02:02:58,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:58,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133142144] [2022-04-28 02:02:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:58,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {2125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {2119#true} is VALID [2022-04-28 02:02:58,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {2119#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2119#true} is VALID [2022-04-28 02:02:58,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2119#true} {2119#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2119#true} is VALID [2022-04-28 02:02:58,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {2119#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:58,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {2125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {2119#true} is VALID [2022-04-28 02:02:58,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {2119#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2119#true} is VALID [2022-04-28 02:02:58,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2119#true} {2119#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2119#true} is VALID [2022-04-28 02:02:58,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {2119#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2119#true} is VALID [2022-04-28 02:02:58,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {2119#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2119#true} is VALID [2022-04-28 02:02:58,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {2119#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {2119#true} is VALID [2022-04-28 02:02:58,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {2119#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {2119#true} is VALID [2022-04-28 02:02:58,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {2119#true} [200] L63-->L63-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[] {2119#true} is VALID [2022-04-28 02:02:58,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {2119#true} [201] L63-2-->L67-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] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {2124#(not (= main_~p2~0 0))} [203] L67-1-->L71-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] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {2124#(not (= main_~p2~0 0))} [205] L71-1-->L75-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] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {2124#(not (= main_~p2~0 0))} [208] L75-1-->L79-1: Formula: (= 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[] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {2124#(not (= main_~p2~0 0))} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {2124#(not (= main_~p2~0 0))} [211] L83-1-->L87-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] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {2124#(not (= main_~p2~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {2124#(not (= main_~p2~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {2124#(not (= main_~p2~0 0))} [218] L95-1-->L101-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[] {2124#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:58,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {2124#(not (= main_~p2~0 0))} [222] L101-1-->L106-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[] {2120#false} is VALID [2022-04-28 02:02:58,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {2120#false} [227] L106-1-->L112: 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[] {2120#false} is VALID [2022-04-28 02:02:58,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {2120#false} [229] L112-->L142-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[] {2120#false} is VALID [2022-04-28 02:02:58,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {2120#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2120#false} is VALID [2022-04-28 02:02:58,166 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:58,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:58,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133142144] [2022-04-28 02:02:58,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133142144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:58,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:58,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646203239] [2022-04-28 02:02:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:58,167 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:58,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:58,167 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:58,178 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:58,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:58,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:58,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:58,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:58,179 INFO L87 Difference]: Start difference. First operand 123 states and 211 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:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,292 INFO L93 Difference]: Finished difference Result 184 states and 314 transitions. [2022-04-28 02:02:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:58,292 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:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:58,292 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:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-28 02:02:58,293 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:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-28 02:02:58,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-28 02:02:58,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:58,403 INFO L225 Difference]: With dead ends: 184 [2022-04-28 02:02:58,403 INFO L226 Difference]: Without dead ends: 127 [2022-04-28 02:02:58,404 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:58,404 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:58,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-28 02:02:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-04-28 02:02:58,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:58,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have 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:58,409 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have 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:58,409 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have 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:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,412 INFO L93 Difference]: Finished difference Result 127 states and 212 transitions. [2022-04-28 02:02:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 212 transitions. [2022-04-28 02:02:58,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:58,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:58,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 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 127 states. [2022-04-28 02:02:58,413 INFO L87 Difference]: Start difference. First operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 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 127 states. [2022-04-28 02:02:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,415 INFO L93 Difference]: Finished difference Result 127 states and 212 transitions. [2022-04-28 02:02:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 212 transitions. [2022-04-28 02:02:58,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:58,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:58,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:58,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have 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:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 211 transitions. [2022-04-28 02:02:58,418 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 211 transitions. Word has length 22 [2022-04-28 02:02:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:58,418 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 211 transitions. [2022-04-28 02:02:58,418 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:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 211 transitions. [2022-04-28 02:02:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:58,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:58,419 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:58,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:02:58,419 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:58,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash 600944466, now seen corresponding path program 1 times [2022-04-28 02:02:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:58,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383330981] [2022-04-28 02:02:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:58,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {2724#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {2718#true} is VALID [2022-04-28 02:02:58,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {2718#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2718#true} is VALID [2022-04-28 02:02:58,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2718#true} {2718#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2718#true} is VALID [2022-04-28 02:02:58,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {2718#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2724#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:58,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {2718#true} is VALID [2022-04-28 02:02:58,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {2718#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2718#true} is VALID [2022-04-28 02:02:58,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2718#true} {2718#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2718#true} is VALID [2022-04-28 02:02:58,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {2718#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2718#true} is VALID [2022-04-28 02:02:58,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {2718#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2718#true} is VALID [2022-04-28 02:02:58,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {2718#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {2718#true} is VALID [2022-04-28 02:02:58,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {2718#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {2718#true} is VALID [2022-04-28 02:02:58,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {2718#true} [200] L63-->L63-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[] {2718#true} is VALID [2022-04-28 02:02:58,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {2718#true} [202] L63-2-->L67-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[] {2718#true} is VALID [2022-04-28 02:02:58,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {2718#true} [203] L67-1-->L71-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] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {2723#(= main_~lk3~0 1)} [205] L71-1-->L75-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] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {2723#(= main_~lk3~0 1)} [208] L75-1-->L79-1: Formula: (= 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[] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {2723#(= main_~lk3~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {2723#(= main_~lk3~0 1)} [211] L83-1-->L87-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] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {2723#(= main_~lk3~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {2723#(= main_~lk3~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {2723#(= main_~lk3~0 1)} [218] L95-1-->L101-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[] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {2723#(= main_~lk3~0 1)} [222] L101-1-->L106-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[] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {2723#(= main_~lk3~0 1)} [227] L106-1-->L112: 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[] {2723#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:58,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {2723#(= main_~lk3~0 1)} [229] L112-->L142-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[] {2719#false} is VALID [2022-04-28 02:02:58,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {2719#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2719#false} is VALID [2022-04-28 02:02:58,454 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:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:58,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383330981] [2022-04-28 02:02:58,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383330981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:58,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:58,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:58,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559981637] [2022-04-28 02:02:58,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:58,454 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:58,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:58,454 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:58,465 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:58,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:58,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:58,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:58,465 INFO L87 Difference]: Start difference. First operand 125 states and 211 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:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,599 INFO L93 Difference]: Finished difference Result 229 states and 393 transitions. [2022-04-28 02:02:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:58,599 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:58,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:58,599 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:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 02:02:58,600 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:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 02:02:58,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 02:02:58,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:58,672 INFO L225 Difference]: With dead ends: 229 [2022-04-28 02:02:58,672 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 02:02:58,673 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:58,673 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:58,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 02:02:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 169. [2022-04-28 02:02:58,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:58,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:58,679 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:58,679 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,684 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2022-04-28 02:02:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 388 transitions. [2022-04-28 02:02:58,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:58,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:58,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 227 states. [2022-04-28 02:02:58,685 INFO L87 Difference]: Start difference. First operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 227 states. [2022-04-28 02:02:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,690 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2022-04-28 02:02:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 388 transitions. [2022-04-28 02:02:58,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:58,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:58,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:58,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 283 transitions. [2022-04-28 02:02:58,695 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 283 transitions. Word has length 22 [2022-04-28 02:02:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:58,695 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 283 transitions. [2022-04-28 02:02:58,695 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:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 283 transitions. [2022-04-28 02:02:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:58,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:58,696 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:58,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 02:02:58,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash 730027185, now seen corresponding path program 1 times [2022-04-28 02:02:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:58,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520486820] [2022-04-28 02:02:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:58,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {3614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {3608#true} is VALID [2022-04-28 02:02:58,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {3608#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3608#true} is VALID [2022-04-28 02:02:58,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3608#true} {3608#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3608#true} is VALID [2022-04-28 02:02:58,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {3608#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:58,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {3614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {3608#true} is VALID [2022-04-28 02:02:58,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {3608#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3608#true} is VALID [2022-04-28 02:02:58,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3608#true} {3608#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3608#true} is VALID [2022-04-28 02:02:58,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {3608#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3608#true} is VALID [2022-04-28 02:02:58,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {3608#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3608#true} is VALID [2022-04-28 02:02:58,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {3608#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {3608#true} is VALID [2022-04-28 02:02:58,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {3608#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {3608#true} is VALID [2022-04-28 02:02:58,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {3608#true} [200] L63-->L63-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[] {3608#true} is VALID [2022-04-28 02:02:58,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {3608#true} [202] L63-2-->L67-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[] {3608#true} is VALID [2022-04-28 02:02:58,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {3608#true} [204] L67-1-->L71-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[] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {3613#(= main_~p3~0 0)} [205] L71-1-->L75-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] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {3613#(= main_~p3~0 0)} [208] L75-1-->L79-1: Formula: (= 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[] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {3613#(= main_~p3~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {3613#(= main_~p3~0 0)} [211] L83-1-->L87-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] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {3613#(= main_~p3~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {3613#(= main_~p3~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {3613#(= main_~p3~0 0)} [218] L95-1-->L101-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[] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {3613#(= main_~p3~0 0)} [222] L101-1-->L106-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[] {3613#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:58,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {3613#(= main_~p3~0 0)} [227] L106-1-->L112: 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[] {3609#false} is VALID [2022-04-28 02:02:58,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {3609#false} [229] L112-->L142-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[] {3609#false} is VALID [2022-04-28 02:02:58,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {3609#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3609#false} is VALID [2022-04-28 02:02:58,733 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:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:58,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520486820] [2022-04-28 02:02:58,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520486820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:58,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:58,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:58,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731097402] [2022-04-28 02:02:58,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:58,734 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:58,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:58,734 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:58,746 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:58,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:58,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:58,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:58,747 INFO L87 Difference]: Start difference. First operand 169 states and 283 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:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,867 INFO L93 Difference]: Finished difference Result 393 states and 665 transitions. [2022-04-28 02:02:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:58,867 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:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:58,868 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:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 02:02:58,869 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:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 02:02:58,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-28 02:02:58,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:58,967 INFO L225 Difference]: With dead ends: 393 [2022-04-28 02:02:58,967 INFO L226 Difference]: Without dead ends: 235 [2022-04-28 02:02:58,970 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:58,971 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:58,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 91 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-28 02:02:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2022-04-28 02:02:58,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:58,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have 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:58,984 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have 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:58,986 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have 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:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,990 INFO L93 Difference]: Finished difference Result 235 states and 388 transitions. [2022-04-28 02:02:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 388 transitions. [2022-04-28 02:02:58,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:58,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:58,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 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 235 states. [2022-04-28 02:02:58,992 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 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 235 states. [2022-04-28 02:02:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,996 INFO L93 Difference]: Finished difference Result 235 states and 388 transitions. [2022-04-28 02:02:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 388 transitions. [2022-04-28 02:02:58,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:58,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:58,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:58,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have 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:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 387 transitions. [2022-04-28 02:02:59,000 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 387 transitions. Word has length 22 [2022-04-28 02:02:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:59,000 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 387 transitions. [2022-04-28 02:02:59,000 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:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 387 transitions. [2022-04-28 02:02:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:59,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:59,001 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:59,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 02:02:59,001 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:59,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:59,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1449441508, now seen corresponding path program 1 times [2022-04-28 02:02:59,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:59,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835205357] [2022-04-28 02:02:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:59,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {4756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {4750#true} is VALID [2022-04-28 02:02:59,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {4750#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4750#true} is VALID [2022-04-28 02:02:59,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4750#true} {4750#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4750#true} is VALID [2022-04-28 02:02:59,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {4750#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:59,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {4756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {4750#true} is VALID [2022-04-28 02:02:59,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {4750#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4750#true} is VALID [2022-04-28 02:02:59,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4750#true} {4750#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4750#true} is VALID [2022-04-28 02:02:59,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {4750#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4750#true} is VALID [2022-04-28 02:02:59,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {4750#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4750#true} is VALID [2022-04-28 02:02:59,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {4750#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {4750#true} is VALID [2022-04-28 02:02:59,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {4750#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {4750#true} is VALID [2022-04-28 02:02:59,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {4750#true} [200] L63-->L63-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[] {4750#true} is VALID [2022-04-28 02:02:59,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {4750#true} [202] L63-2-->L67-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[] {4750#true} is VALID [2022-04-28 02:02:59,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {4750#true} [203] L67-1-->L71-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] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {4755#(not (= main_~p3~0 0))} [205] L71-1-->L75-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] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {4755#(not (= main_~p3~0 0))} [208] L75-1-->L79-1: Formula: (= 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[] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {4755#(not (= main_~p3~0 0))} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {4755#(not (= main_~p3~0 0))} [211] L83-1-->L87-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] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {4755#(not (= main_~p3~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {4755#(not (= main_~p3~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {4755#(not (= main_~p3~0 0))} [218] L95-1-->L101-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[] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {4755#(not (= main_~p3~0 0))} [222] L101-1-->L106-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[] {4755#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:59,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#(not (= main_~p3~0 0))} [228] L106-1-->L111-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[] {4751#false} is VALID [2022-04-28 02:02:59,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {4751#false} [231] L111-1-->L117: 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[] {4751#false} is VALID [2022-04-28 02:02:59,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {4751#false} [233] L117-->L142-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[] {4751#false} is VALID [2022-04-28 02:02:59,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {4751#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4751#false} is VALID [2022-04-28 02:02:59,071 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:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835205357] [2022-04-28 02:02:59,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835205357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:59,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:59,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921206314] [2022-04-28 02:02:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:59,071 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:59,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:59,072 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:59,082 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:59,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:59,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:59,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:59,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:59,083 INFO L87 Difference]: Start difference. First operand 233 states and 387 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:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,207 INFO L93 Difference]: Finished difference Result 349 states and 577 transitions. [2022-04-28 02:02:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:59,207 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:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:59,207 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:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 02:02:59,209 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:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 02:02:59,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 02:02:59,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:59,311 INFO L225 Difference]: With dead ends: 349 [2022-04-28 02:02:59,311 INFO L226 Difference]: Without dead ends: 239 [2022-04-28 02:02:59,311 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:59,313 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 97 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:59,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 97 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-28 02:02:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-04-28 02:02:59,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:59,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have 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:59,330 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have 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:59,330 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have 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:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,335 INFO L93 Difference]: Finished difference Result 239 states and 388 transitions. [2022-04-28 02:02:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 02:02:59,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:59,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:59,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 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 239 states. [2022-04-28 02:02:59,336 INFO L87 Difference]: Start difference. First operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 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 239 states. [2022-04-28 02:02:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,340 INFO L93 Difference]: Finished difference Result 239 states and 388 transitions. [2022-04-28 02:02:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 02:02:59,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:59,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:59,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:59,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have 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:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 387 transitions. [2022-04-28 02:02:59,344 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 387 transitions. Word has length 23 [2022-04-28 02:02:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:59,345 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 387 transitions. [2022-04-28 02:02:59,345 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:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 387 transitions. [2022-04-28 02:02:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:59,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:59,347 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:59,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 02:02:59,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:59,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1156038501, now seen corresponding path program 1 times [2022-04-28 02:02:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:59,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352073986] [2022-04-28 02:02:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:59,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {5866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {5860#true} is VALID [2022-04-28 02:02:59,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {5860#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5860#true} is VALID [2022-04-28 02:02:59,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5860#true} {5860#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5860#true} is VALID [2022-04-28 02:02:59,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {5860#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:59,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {5866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {5860#true} is VALID [2022-04-28 02:02:59,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {5860#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5860#true} {5860#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {5860#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {5860#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {5860#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {5860#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {5860#true} [200] L63-->L63-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[] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {5860#true} [202] L63-2-->L67-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[] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {5860#true} [204] L67-1-->L71-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[] {5860#true} is VALID [2022-04-28 02:02:59,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {5860#true} [205] L71-1-->L75-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] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {5865#(= main_~lk4~0 1)} [208] L75-1-->L79-1: Formula: (= 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[] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {5865#(= main_~lk4~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {5865#(= main_~lk4~0 1)} [211] L83-1-->L87-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] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {5865#(= main_~lk4~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {5865#(= main_~lk4~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {5865#(= main_~lk4~0 1)} [218] L95-1-->L101-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[] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {5865#(= main_~lk4~0 1)} [222] L101-1-->L106-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[] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {5865#(= main_~lk4~0 1)} [228] L106-1-->L111-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[] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {5865#(= main_~lk4~0 1)} [231] L111-1-->L117: 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[] {5865#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:59,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {5865#(= main_~lk4~0 1)} [233] L117-->L142-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[] {5861#false} is VALID [2022-04-28 02:02:59,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {5861#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5861#false} is VALID [2022-04-28 02:02:59,377 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:59,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:59,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352073986] [2022-04-28 02:02:59,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352073986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:59,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:59,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372354750] [2022-04-28 02:02:59,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:59,378 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:59,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:59,378 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:59,390 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:59,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:59,390 INFO L87 Difference]: Start difference. First operand 237 states and 387 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:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,515 INFO L93 Difference]: Finished difference Result 429 states and 713 transitions. [2022-04-28 02:02:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:59,515 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:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:59,515 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:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 02:02:59,516 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:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 02:02:59,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-28 02:02:59,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:59,587 INFO L225 Difference]: With dead ends: 429 [2022-04-28 02:02:59,587 INFO L226 Difference]: Without dead ends: 427 [2022-04-28 02:02:59,588 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:59,588 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:59,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-28 02:02:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2022-04-28 02:02:59,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:59,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have 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:59,594 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have 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:59,595 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have 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:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,604 INFO L93 Difference]: Finished difference Result 427 states and 704 transitions. [2022-04-28 02:02:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 704 transitions. [2022-04-28 02:02:59,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:59,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:59,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 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 427 states. [2022-04-28 02:02:59,606 INFO L87 Difference]: Start difference. First operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 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 427 states. [2022-04-28 02:02:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,615 INFO L93 Difference]: Finished difference Result 427 states and 704 transitions. [2022-04-28 02:02:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 704 transitions. [2022-04-28 02:02:59,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:59,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:59,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:59,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have 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:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 527 transitions. [2022-04-28 02:02:59,622 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 527 transitions. Word has length 23 [2022-04-28 02:02:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:59,622 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 527 transitions. [2022-04-28 02:02:59,622 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:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 527 transitions. [2022-04-28 02:02:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:59,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:59,623 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:59,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 02:02:59,623 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1285121220, now seen corresponding path program 1 times [2022-04-28 02:02:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:59,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636918379] [2022-04-28 02:02:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:59,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:59,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {7528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {7522#true} is VALID [2022-04-28 02:02:59,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {7522#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7522#true} is VALID [2022-04-28 02:02:59,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7522#true} {7522#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7522#true} is VALID [2022-04-28 02:02:59,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {7522#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:59,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {7528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {7522#true} is VALID [2022-04-28 02:02:59,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {7522#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7522#true} is VALID [2022-04-28 02:02:59,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7522#true} {7522#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7522#true} is VALID [2022-04-28 02:02:59,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {7522#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7522#true} is VALID [2022-04-28 02:02:59,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {7522#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {7522#true} is VALID [2022-04-28 02:02:59,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {7522#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {7522#true} is VALID [2022-04-28 02:02:59,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {7522#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {7522#true} is VALID [2022-04-28 02:02:59,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {7522#true} [200] L63-->L63-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[] {7522#true} is VALID [2022-04-28 02:02:59,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {7522#true} [202] L63-2-->L67-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[] {7522#true} is VALID [2022-04-28 02:02:59,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {7522#true} [204] L67-1-->L71-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[] {7522#true} is VALID [2022-04-28 02:02:59,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {7522#true} [206] L71-1-->L75-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[] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {7527#(= main_~p4~0 0)} [208] L75-1-->L79-1: Formula: (= 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[] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {7527#(= main_~p4~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {7527#(= main_~p4~0 0)} [211] L83-1-->L87-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] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {7527#(= main_~p4~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {7527#(= main_~p4~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {7527#(= main_~p4~0 0)} [218] L95-1-->L101-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[] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {7527#(= main_~p4~0 0)} [222] L101-1-->L106-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[] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {7527#(= main_~p4~0 0)} [228] L106-1-->L111-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[] {7527#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:59,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {7527#(= main_~p4~0 0)} [231] L111-1-->L117: 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[] {7523#false} is VALID [2022-04-28 02:02:59,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {7523#false} [233] L117-->L142-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[] {7523#false} is VALID [2022-04-28 02:02:59,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {7523#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7523#false} is VALID [2022-04-28 02:02:59,652 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:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:59,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636918379] [2022-04-28 02:02:59,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636918379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:59,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:59,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231602219] [2022-04-28 02:02:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:59,653 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:59,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:59,653 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:59,663 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:59,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:59,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:59,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:59,664 INFO L87 Difference]: Start difference. First operand 329 states and 527 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:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,795 INFO L93 Difference]: Finished difference Result 765 states and 1233 transitions. [2022-04-28 02:02:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:59,795 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:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:59,795 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:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 02:02:59,796 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:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 02:02:59,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-28 02:02:59,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:59,906 INFO L225 Difference]: With dead ends: 765 [2022-04-28 02:02:59,906 INFO L226 Difference]: Without dead ends: 451 [2022-04-28 02:02:59,906 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:59,907 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:59,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 93 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-28 02:02:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-04-28 02:02:59,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:59,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have 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:59,915 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have 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:59,916 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have 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:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,925 INFO L93 Difference]: Finished difference Result 451 states and 712 transitions. [2022-04-28 02:02:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 712 transitions. [2022-04-28 02:02:59,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:59,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:59,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 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 451 states. [2022-04-28 02:02:59,927 INFO L87 Difference]: Start difference. First operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 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 451 states. [2022-04-28 02:02:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,937 INFO L93 Difference]: Finished difference Result 451 states and 712 transitions. [2022-04-28 02:02:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 712 transitions. [2022-04-28 02:02:59,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:59,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:59,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:59,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have 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:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 711 transitions. [2022-04-28 02:02:59,947 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 711 transitions. Word has length 23 [2022-04-28 02:02:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:59,947 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 711 transitions. [2022-04-28 02:02:59,947 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:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 711 transitions. [2022-04-28 02:02:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:02:59,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:59,948 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:59,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 02:02:59,948 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1477487533, now seen corresponding path program 1 times [2022-04-28 02:02:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:59,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854894893] [2022-04-28 02:02:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:59,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:59,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {9710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {9704#true} is VALID [2022-04-28 02:02:59,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {9704#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9704#true} is VALID [2022-04-28 02:02:59,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9704#true} {9704#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9704#true} is VALID [2022-04-28 02:02:59,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {9704#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:59,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {9710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {9704#true} is VALID [2022-04-28 02:02:59,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {9704#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9704#true} is VALID [2022-04-28 02:02:59,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9704#true} {9704#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9704#true} is VALID [2022-04-28 02:02:59,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {9704#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9704#true} is VALID [2022-04-28 02:02:59,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {9704#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {9704#true} is VALID [2022-04-28 02:02:59,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {9704#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {9704#true} is VALID [2022-04-28 02:02:59,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {9704#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {9704#true} is VALID [2022-04-28 02:02:59,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {9704#true} [200] L63-->L63-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[] {9704#true} is VALID [2022-04-28 02:02:59,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {9704#true} [202] L63-2-->L67-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[] {9704#true} is VALID [2022-04-28 02:02:59,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {9704#true} [204] L67-1-->L71-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[] {9704#true} is VALID [2022-04-28 02:02:59,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {9704#true} [205] L71-1-->L75-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] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {9709#(not (= main_~p4~0 0))} [208] L75-1-->L79-1: Formula: (= 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[] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {9709#(not (= main_~p4~0 0))} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {9709#(not (= main_~p4~0 0))} [211] L83-1-->L87-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] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {9709#(not (= main_~p4~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {9709#(not (= main_~p4~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {9709#(not (= main_~p4~0 0))} [218] L95-1-->L101-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[] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {9709#(not (= main_~p4~0 0))} [222] L101-1-->L106-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[] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {9709#(not (= main_~p4~0 0))} [228] L106-1-->L111-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[] {9709#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:59,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {9709#(not (= main_~p4~0 0))} [232] L111-1-->L116-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[] {9705#false} is VALID [2022-04-28 02:02:59,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {9705#false} [235] L116-1-->L122: Formula: (not (= 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[] {9705#false} is VALID [2022-04-28 02:02:59,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {9705#false} [237] L122-->L142-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[] {9705#false} is VALID [2022-04-28 02:02:59,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {9705#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9705#false} is VALID [2022-04-28 02:02:59,981 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:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854894893] [2022-04-28 02:02:59,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854894893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:59,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:59,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799868681] [2022-04-28 02:02:59,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:59,981 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:59,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:59,982 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:59,994 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:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:59,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:59,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:59,995 INFO L87 Difference]: Start difference. First operand 449 states and 711 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:03:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:00,126 INFO L93 Difference]: Finished difference Result 673 states and 1061 transitions. [2022-04-28 02:03:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:00,126 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:03:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:00,127 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:03:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-28 02:03:00,128 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:03:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-28 02:03:00,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-28 02:03:00,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:00,235 INFO L225 Difference]: With dead ends: 673 [2022-04-28 02:03:00,235 INFO L226 Difference]: Without dead ends: 459 [2022-04-28 02:03:00,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:03:00,237 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:00,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 94 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-28 02:03:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2022-04-28 02:03:00,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:00,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have 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:03:00,246 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have 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:03:00,246 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have 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:03:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:00,256 INFO L93 Difference]: Finished difference Result 459 states and 712 transitions. [2022-04-28 02:03:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 712 transitions. [2022-04-28 02:03:00,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:00,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:00,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 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 459 states. [2022-04-28 02:03:00,258 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 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 459 states. [2022-04-28 02:03:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:00,268 INFO L93 Difference]: Finished difference Result 459 states and 712 transitions. [2022-04-28 02:03:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 712 transitions. [2022-04-28 02:03:00,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:00,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:00,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:00,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have 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:03:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 711 transitions. [2022-04-28 02:03:00,280 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 711 transitions. Word has length 24 [2022-04-28 02:03:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:00,280 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 711 transitions. [2022-04-28 02:03:00,280 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:03:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 711 transitions. [2022-04-28 02:03:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:03:00,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:00,281 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:03:00,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 02:03:00,281 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:00,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1184084526, now seen corresponding path program 1 times [2022-04-28 02:03:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:00,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147412466] [2022-04-28 02:03:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:00,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:00,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:00,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {11824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {11818#true} is VALID [2022-04-28 02:03:00,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {11818#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11818#true} is VALID [2022-04-28 02:03:00,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11818#true} {11818#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11818#true} is VALID [2022-04-28 02:03:00,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {11818#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:00,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {11824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {11818#true} is VALID [2022-04-28 02:03:00,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {11818#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11818#true} is VALID [2022-04-28 02:03:00,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11818#true} {11818#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11818#true} is VALID [2022-04-28 02:03:00,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {11818#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11818#true} is VALID [2022-04-28 02:03:00,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {11818#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {11818#true} is VALID [2022-04-28 02:03:00,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {11818#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {11818#true} is VALID [2022-04-28 02:03:00,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {11818#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {11818#true} is VALID [2022-04-28 02:03:00,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {11818#true} [200] L63-->L63-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[] {11818#true} is VALID [2022-04-28 02:03:00,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {11818#true} [202] L63-2-->L67-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[] {11818#true} is VALID [2022-04-28 02:03:00,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {11818#true} [204] L67-1-->L71-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[] {11818#true} is VALID [2022-04-28 02:03:00,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {11818#true} [206] L71-1-->L75-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[] {11818#true} is VALID [2022-04-28 02:03:00,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {11818#true} [208] L75-1-->L79-1: Formula: (= 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[] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {11823#(= main_~p5~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {11823#(= main_~p5~0 0)} [211] L83-1-->L87-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] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {11823#(= main_~p5~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {11823#(= main_~p5~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {11823#(= main_~p5~0 0)} [218] L95-1-->L101-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[] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {11823#(= main_~p5~0 0)} [222] L101-1-->L106-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[] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {11823#(= main_~p5~0 0)} [228] L106-1-->L111-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[] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {11823#(= main_~p5~0 0)} [232] L111-1-->L116-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[] {11823#(= main_~p5~0 0)} is VALID [2022-04-28 02:03:00,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {11823#(= main_~p5~0 0)} [235] L116-1-->L122: Formula: (not (= 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[] {11819#false} is VALID [2022-04-28 02:03:00,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {11819#false} [237] L122-->L142-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[] {11819#false} is VALID [2022-04-28 02:03:00,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {11819#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11819#false} is VALID [2022-04-28 02:03:00,324 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:03:00,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:00,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147412466] [2022-04-28 02:03:00,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147412466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:00,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:00,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445694027] [2022-04-28 02:03:00,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:00,325 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:03:00,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:00,325 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:03:00,336 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:03:00,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:00,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:00,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:00,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:00,338 INFO L87 Difference]: Start difference. First operand 457 states and 711 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:03:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:00,502 INFO L93 Difference]: Finished difference Result 1309 states and 2025 transitions. [2022-04-28 02:03:00,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:00,502 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:03:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:00,502 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:03:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 02:03:00,504 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:03:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 02:03:00,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 02:03:00,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:00,621 INFO L225 Difference]: With dead ends: 1309 [2022-04-28 02:03:00,621 INFO L226 Difference]: Without dead ends: 875 [2022-04-28 02:03:00,622 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:03:00,623 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:00,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 76 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-04-28 02:03:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2022-04-28 02:03:00,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:00,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have 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:03:00,640 INFO L74 IsIncluded]: Start isIncluded. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have 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:03:00,641 INFO L87 Difference]: Start difference. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have 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:03:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:00,670 INFO L93 Difference]: Finished difference Result 875 states and 1320 transitions. [2022-04-28 02:03:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1320 transitions. [2022-04-28 02:03:00,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:00,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:00,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 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 875 states. [2022-04-28 02:03:00,673 INFO L87 Difference]: Start difference. First operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 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 875 states. [2022-04-28 02:03:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:00,701 INFO L93 Difference]: Finished difference Result 875 states and 1320 transitions. [2022-04-28 02:03:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1320 transitions. [2022-04-28 02:03:00,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:00,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:00,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:00,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have 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:03:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1319 transitions. [2022-04-28 02:03:00,746 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1319 transitions. Word has length 24 [2022-04-28 02:03:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:00,746 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1319 transitions. [2022-04-28 02:03:00,746 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:03:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1319 transitions. [2022-04-28 02:03:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:03:00,747 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:00,747 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:03:00,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 02:03:00,747 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1055001807, now seen corresponding path program 1 times [2022-04-28 02:03:00,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:00,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618399484] [2022-04-28 02:03:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:00,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {15862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {15856#true} is VALID [2022-04-28 02:03:00,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {15856#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15856#true} is VALID [2022-04-28 02:03:00,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15856#true} {15856#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15856#true} is VALID [2022-04-28 02:03:00,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {15856#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:00,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {15862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {15856#true} is VALID [2022-04-28 02:03:00,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {15856#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15856#true} {15856#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {15856#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {15856#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {15856#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {15856#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {15856#true} [200] L63-->L63-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[] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {15856#true} [202] L63-2-->L67-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[] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {15856#true} [204] L67-1-->L71-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[] {15856#true} is VALID [2022-04-28 02:03:00,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {15856#true} [206] L71-1-->L75-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[] {15856#true} is VALID [2022-04-28 02:03:00,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {15856#true} [207] L75-1-->L79-1: Formula: (and (not (= v_main_~p5~0_3 0)) (= v_main_~lk5~0_3 1)) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {15861#(= main_~lk5~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {15861#(= main_~lk5~0 1)} [211] L83-1-->L87-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] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {15861#(= main_~lk5~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {15861#(= main_~lk5~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {15861#(= main_~lk5~0 1)} [218] L95-1-->L101-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[] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {15861#(= main_~lk5~0 1)} [222] L101-1-->L106-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[] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {15861#(= main_~lk5~0 1)} [228] L106-1-->L111-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[] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {15861#(= main_~lk5~0 1)} [232] L111-1-->L116-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[] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {15861#(= main_~lk5~0 1)} [235] L116-1-->L122: Formula: (not (= 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[] {15861#(= main_~lk5~0 1)} is VALID [2022-04-28 02:03:00,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {15861#(= main_~lk5~0 1)} [237] L122-->L142-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[] {15857#false} is VALID [2022-04-28 02:03:00,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {15857#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15857#false} is VALID [2022-04-28 02:03:00,778 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:03:00,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:00,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618399484] [2022-04-28 02:03:00,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618399484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:00,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:00,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147238415] [2022-04-28 02:03:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:00,779 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:03:00,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:00,779 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:03:00,792 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:03:00,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:00,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:00,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:00,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:00,793 INFO L87 Difference]: Start difference. First operand 873 states and 1319 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:03:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:00,939 INFO L93 Difference]: Finished difference Result 1037 states and 1609 transitions. [2022-04-28 02:03:00,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:00,939 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:03:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:00,939 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:03:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 02:03:00,940 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:03:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 02:03:00,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-28 02:03:00,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:01,034 INFO L225 Difference]: With dead ends: 1037 [2022-04-28 02:03:01,034 INFO L226 Difference]: Without dead ends: 1035 [2022-04-28 02:03:01,035 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:03:01,035 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:01,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 104 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-04-28 02:03:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 873. [2022-04-28 02:03:01,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:01,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1035 states. Second operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:03:01,052 INFO L74 IsIncluded]: Start isIncluded. First operand 1035 states. Second operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:03:01,052 INFO L87 Difference]: Start difference. First operand 1035 states. Second operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:03:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:01,090 INFO L93 Difference]: Finished difference Result 1035 states and 1592 transitions. [2022-04-28 02:03:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1592 transitions. [2022-04-28 02:03:01,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:01,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:01,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 states have internal predecessors, (1300), 2 states have call successors, (2), 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 1035 states. [2022-04-28 02:03:01,093 INFO L87 Difference]: Start difference. First operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 states have internal predecessors, (1300), 2 states have call successors, (2), 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 1035 states. [2022-04-28 02:03:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:01,129 INFO L93 Difference]: Finished difference Result 1035 states and 1592 transitions. [2022-04-28 02:03:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1592 transitions. [2022-04-28 02:03:01,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:01,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:01,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:01,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:03:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1303 transitions. [2022-04-28 02:03:01,161 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1303 transitions. Word has length 24 [2022-04-28 02:03:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:01,162 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1303 transitions. [2022-04-28 02:03:01,162 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:03:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1303 transitions. [2022-04-28 02:03:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:03:01,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:01,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:01,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 02:03:01,163 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1948052864, now seen corresponding path program 1 times [2022-04-28 02:03:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:01,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339636460] [2022-04-28 02:03:01,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:01,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {19948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {19942#true} is VALID [2022-04-28 02:03:01,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {19942#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19942#true} is VALID [2022-04-28 02:03:01,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19942#true} {19942#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {19942#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:01,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {19948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {19942#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19942#true} {19942#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {19942#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {19942#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {19942#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {19942#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {19942#true} [200] L63-->L63-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[] {19942#true} is VALID [2022-04-28 02:03:01,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {19942#true} [202] L63-2-->L67-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[] {19942#true} is VALID [2022-04-28 02:03:01,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {19942#true} [204] L67-1-->L71-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[] {19942#true} is VALID [2022-04-28 02:03:01,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {19942#true} [206] L71-1-->L75-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[] {19942#true} is VALID [2022-04-28 02:03:01,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {19942#true} [208] L75-1-->L79-1: Formula: (= 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[] {19942#true} is VALID [2022-04-28 02:03:01,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {19942#true} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {19947#(= main_~lk6~0 1)} [211] L83-1-->L87-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] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {19947#(= main_~lk6~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {19947#(= main_~lk6~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {19947#(= main_~lk6~0 1)} [218] L95-1-->L101-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[] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {19947#(= main_~lk6~0 1)} [222] L101-1-->L106-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[] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {19947#(= main_~lk6~0 1)} [228] L106-1-->L111-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[] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {19947#(= main_~lk6~0 1)} [232] L111-1-->L116-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[] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {19947#(= main_~lk6~0 1)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {19947#(= main_~lk6~0 1)} [239] L121-1-->L127: Formula: (not (= 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[] {19947#(= main_~lk6~0 1)} is VALID [2022-04-28 02:03:01,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {19947#(= main_~lk6~0 1)} [241] L127-->L142-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {19943#false} is VALID [2022-04-28 02:03:01,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {19943#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19943#false} is VALID [2022-04-28 02:03:01,226 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:03:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:01,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339636460] [2022-04-28 02:03:01,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339636460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:01,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:01,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163348210] [2022-04-28 02:03:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:01,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:03:01,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:01,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:01,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:01,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:01,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:01,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:01,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:01,242 INFO L87 Difference]: Start difference. First operand 873 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:01,430 INFO L93 Difference]: Finished difference Result 1533 states and 2329 transitions. [2022-04-28 02:03:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:01,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:03:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 02:03:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 02:03:01,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-28 02:03:01,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:01,561 INFO L225 Difference]: With dead ends: 1533 [2022-04-28 02:03:01,561 INFO L226 Difference]: Without dead ends: 1531 [2022-04-28 02:03:01,563 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:03:01,564 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 67 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:01,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-04-28 02:03:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1273. [2022-04-28 02:03:01,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:01,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1531 states. Second operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have 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:03:01,587 INFO L74 IsIncluded]: Start isIncluded. First operand 1531 states. Second operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have 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:03:01,588 INFO L87 Difference]: Start difference. First operand 1531 states. Second operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have 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:03:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:01,682 INFO L93 Difference]: Finished difference Result 1531 states and 2296 transitions. [2022-04-28 02:03:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2296 transitions. [2022-04-28 02:03:01,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:01,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:01,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 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 1531 states. [2022-04-28 02:03:01,686 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 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 1531 states. [2022-04-28 02:03:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:01,757 INFO L93 Difference]: Finished difference Result 1531 states and 2296 transitions. [2022-04-28 02:03:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2296 transitions. [2022-04-28 02:03:01,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:01,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:01,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:01,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have 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:03:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1847 transitions. [2022-04-28 02:03:01,816 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1847 transitions. Word has length 25 [2022-04-28 02:03:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:01,816 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1847 transitions. [2022-04-28 02:03:01,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1847 transitions. [2022-04-28 02:03:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:03:01,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:01,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:01,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 02:03:01,818 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1818970145, now seen corresponding path program 1 times [2022-04-28 02:03:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:01,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598343892] [2022-04-28 02:03:01,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:01,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {25938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {25932#true} is VALID [2022-04-28 02:03:01,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {25932#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25932#true} is VALID [2022-04-28 02:03:01,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25932#true} {25932#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25932#true} is VALID [2022-04-28 02:03:01,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {25932#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:01,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {25938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {25932#true} is VALID [2022-04-28 02:03:01,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {25932#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25932#true} is VALID [2022-04-28 02:03:01,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25932#true} {25932#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25932#true} is VALID [2022-04-28 02:03:01,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {25932#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25932#true} is VALID [2022-04-28 02:03:01,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {25932#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {25932#true} is VALID [2022-04-28 02:03:01,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {25932#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {25932#true} is VALID [2022-04-28 02:03:01,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {25932#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {25932#true} is VALID [2022-04-28 02:03:01,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {25932#true} [200] L63-->L63-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[] {25932#true} is VALID [2022-04-28 02:03:01,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {25932#true} [202] L63-2-->L67-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[] {25932#true} is VALID [2022-04-28 02:03:01,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {25932#true} [204] L67-1-->L71-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[] {25932#true} is VALID [2022-04-28 02:03:01,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {25932#true} [206] L71-1-->L75-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[] {25932#true} is VALID [2022-04-28 02:03:01,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {25932#true} [208] L75-1-->L79-1: Formula: (= 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[] {25932#true} is VALID [2022-04-28 02:03:01,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {25932#true} [210] L79-1-->L83-1: Formula: (= 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[] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {25937#(= main_~p6~0 0)} [211] L83-1-->L87-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] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {25937#(= main_~p6~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {25937#(= main_~p6~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {25937#(= main_~p6~0 0)} [218] L95-1-->L101-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[] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {25937#(= main_~p6~0 0)} [222] L101-1-->L106-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[] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {25937#(= main_~p6~0 0)} [228] L106-1-->L111-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[] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {25937#(= main_~p6~0 0)} [232] L111-1-->L116-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[] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {25937#(= main_~p6~0 0)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {25937#(= main_~p6~0 0)} is VALID [2022-04-28 02:03:01,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {25937#(= main_~p6~0 0)} [239] L121-1-->L127: Formula: (not (= 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[] {25933#false} is VALID [2022-04-28 02:03:01,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {25933#false} [241] L127-->L142-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {25933#false} is VALID [2022-04-28 02:03:01,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {25933#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25933#false} is VALID [2022-04-28 02:03:01,869 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:03:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:01,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598343892] [2022-04-28 02:03:01,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598343892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:01,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:01,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809771817] [2022-04-28 02:03:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:03:01,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:01,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:01,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:01,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:01,884 INFO L87 Difference]: Start difference. First operand 1273 states and 1847 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:02,251 INFO L93 Difference]: Finished difference Result 2941 states and 4281 transitions. [2022-04-28 02:03:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:03:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 02:03:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 02:03:02,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-28 02:03:02,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:02,453 INFO L225 Difference]: With dead ends: 2941 [2022-04-28 02:03:02,454 INFO L226 Difference]: Without dead ends: 1691 [2022-04-28 02:03:02,455 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:03:02,456 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:02,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 97 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:02,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-04-28 02:03:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1689. [2022-04-28 02:03:02,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:02,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1691 states. Second operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 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:03:02,484 INFO L74 IsIncluded]: Start isIncluded. First operand 1691 states. Second operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 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:03:02,485 INFO L87 Difference]: Start difference. First operand 1691 states. Second operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 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:03:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:02,572 INFO L93 Difference]: Finished difference Result 1691 states and 2408 transitions. [2022-04-28 02:03:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2408 transitions. [2022-04-28 02:03:02,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:02,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:02,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 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 1691 states. [2022-04-28 02:03:02,577 INFO L87 Difference]: Start difference. First operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 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 1691 states. [2022-04-28 02:03:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:02,673 INFO L93 Difference]: Finished difference Result 1691 states and 2408 transitions. [2022-04-28 02:03:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2408 transitions. [2022-04-28 02:03:02,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:02,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:02,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:02,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 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:03:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2407 transitions. [2022-04-28 02:03:02,773 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2407 transitions. Word has length 25 [2022-04-28 02:03:02,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:02,773 INFO L495 AbstractCegarLoop]: Abstraction has 1689 states and 2407 transitions. [2022-04-28 02:03:02,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2407 transitions. [2022-04-28 02:03:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:03:02,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:02,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:02,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 02:03:02,775 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -260064022, now seen corresponding path program 1 times [2022-04-28 02:03:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:02,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54190432] [2022-04-28 02:03:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:02,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {34136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {34130#true} is VALID [2022-04-28 02:03:02,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {34130#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34130#true} is VALID [2022-04-28 02:03:02,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34130#true} {34130#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34130#true} is VALID [2022-04-28 02:03:02,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {34130#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:02,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {34136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {34130#true} is VALID [2022-04-28 02:03:02,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {34130#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34130#true} is VALID [2022-04-28 02:03:02,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34130#true} {34130#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34130#true} is VALID [2022-04-28 02:03:02,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {34130#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34130#true} is VALID [2022-04-28 02:03:02,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {34130#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {34130#true} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {34130#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {34130#true} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {34130#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {34130#true} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {34130#true} [200] L63-->L63-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[] {34130#true} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {34130#true} [202] L63-2-->L67-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[] {34130#true} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {34130#true} [204] L67-1-->L71-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[] {34130#true} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {34130#true} [206] L71-1-->L75-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[] {34130#true} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {34130#true} [208] L75-1-->L79-1: Formula: (= 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[] {34130#true} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {34130#true} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {34135#(not (= main_~p6~0 0))} [211] L83-1-->L87-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] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {34135#(not (= main_~p6~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {34135#(not (= main_~p6~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {34135#(not (= main_~p6~0 0))} [218] L95-1-->L101-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[] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {34135#(not (= main_~p6~0 0))} [222] L101-1-->L106-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[] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {34135#(not (= main_~p6~0 0))} [228] L106-1-->L111-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[] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {34135#(not (= main_~p6~0 0))} [232] L111-1-->L116-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[] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {34135#(not (= main_~p6~0 0))} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {34135#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:03:02,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {34135#(not (= main_~p6~0 0))} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {34131#false} is VALID [2022-04-28 02:03:02,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {34131#false} [243] L126-1-->L132: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {34131#false} is VALID [2022-04-28 02:03:02,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {34131#false} [245] L132-->L142-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[] {34131#false} is VALID [2022-04-28 02:03:02,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {34131#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34131#false} is VALID [2022-04-28 02:03:02,807 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:03:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:02,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54190432] [2022-04-28 02:03:02,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54190432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:02,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:02,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:02,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144571777] [2022-04-28 02:03:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:02,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:03:02,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:02,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:02,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:02,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:02,822 INFO L87 Difference]: Start difference. First operand 1689 states and 2407 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:03,163 INFO L93 Difference]: Finished difference Result 2557 states and 3641 transitions. [2022-04-28 02:03:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:03,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:03:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 02:03:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 02:03:03,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-28 02:03:03,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:03,356 INFO L225 Difference]: With dead ends: 2557 [2022-04-28 02:03:03,356 INFO L226 Difference]: Without dead ends: 1739 [2022-04-28 02:03:03,357 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:03:03,358 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:03,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-28 02:03:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2022-04-28 02:03:03,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:03,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have 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:03:03,385 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have 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:03:03,386 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have 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:03:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:03,476 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-28 02:03:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-28 02:03:03,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:03,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:03,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1739 states. [2022-04-28 02:03:03,482 INFO L87 Difference]: Start difference. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1739 states. [2022-04-28 02:03:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:03,579 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-28 02:03:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-28 02:03:03,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:03,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:03,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:03,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have 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:03:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2022-04-28 02:03:03,683 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2022-04-28 02:03:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:03,684 INFO L495 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2022-04-28 02:03:03,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2022-04-28 02:03:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:03:03,685 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:03,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:03,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 02:03:03,685 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash -553467029, now seen corresponding path program 1 times [2022-04-28 02:03:03,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:03,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012859598] [2022-04-28 02:03:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:03,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:03,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {42094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {42088#true} is VALID [2022-04-28 02:03:03,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {42088#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42088#true} is VALID [2022-04-28 02:03:03,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42088#true} {42088#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42088#true} is VALID [2022-04-28 02:03:03,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {42088#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:03,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {42094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {42088#true} is VALID [2022-04-28 02:03:03,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {42088#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42088#true} is VALID [2022-04-28 02:03:03,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42088#true} {42088#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42088#true} is VALID [2022-04-28 02:03:03,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {42088#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42088#true} is VALID [2022-04-28 02:03:03,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {42088#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {42088#true} is VALID [2022-04-28 02:03:03,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {42088#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {42088#true} is VALID [2022-04-28 02:03:03,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {42088#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {42088#true} is VALID [2022-04-28 02:03:03,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {42088#true} [200] L63-->L63-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[] {42088#true} is VALID [2022-04-28 02:03:03,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {42088#true} [202] L63-2-->L67-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[] {42088#true} is VALID [2022-04-28 02:03:03,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {42088#true} [204] L67-1-->L71-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[] {42088#true} is VALID [2022-04-28 02:03:03,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {42088#true} [206] L71-1-->L75-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[] {42088#true} is VALID [2022-04-28 02:03:03,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {42088#true} [208] L75-1-->L79-1: Formula: (= 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[] {42088#true} is VALID [2022-04-28 02:03:03,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {42088#true} [210] L79-1-->L83-1: Formula: (= 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[] {42088#true} is VALID [2022-04-28 02:03:03,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {42088#true} [211] L83-1-->L87-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] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {42093#(= main_~lk7~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {42093#(= main_~lk7~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {42093#(= main_~lk7~0 1)} [218] L95-1-->L101-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[] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {42093#(= main_~lk7~0 1)} [222] L101-1-->L106-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[] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {42093#(= main_~lk7~0 1)} [228] L106-1-->L111-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[] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {42093#(= main_~lk7~0 1)} [232] L111-1-->L116-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[] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {42093#(= main_~lk7~0 1)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {42093#(= main_~lk7~0 1)} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {42093#(= main_~lk7~0 1)} [243] L126-1-->L132: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {42093#(= main_~lk7~0 1)} is VALID [2022-04-28 02:03:03,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {42093#(= main_~lk7~0 1)} [245] L132-->L142-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[] {42089#false} is VALID [2022-04-28 02:03:03,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {42089#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42089#false} is VALID [2022-04-28 02:03:03,717 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:03:03,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:03,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012859598] [2022-04-28 02:03:03,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012859598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:03,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:03,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:03,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708053857] [2022-04-28 02:03:03,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:03,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:03:03,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:03,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:03,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:03,733 INFO L87 Difference]: Start difference. First operand 1737 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:04,120 INFO L93 Difference]: Finished difference Result 2957 states and 4201 transitions. [2022-04-28 02:03:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:03:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 02:03:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 02:03:04,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-28 02:03:04,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:04,461 INFO L225 Difference]: With dead ends: 2957 [2022-04-28 02:03:04,462 INFO L226 Difference]: Without dead ends: 2955 [2022-04-28 02:03:04,462 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:03:04,463 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:04,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-28 02:03:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2022-04-28 02:03:04,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:04,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have 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:03:04,499 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have 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:03:04,501 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have 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:03:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:04,737 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-28 02:03:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-28 02:03:04,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:04,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:04,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 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 2955 states. [2022-04-28 02:03:04,746 INFO L87 Difference]: Start difference. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 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 2955 states. [2022-04-28 02:03:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:04,999 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-28 02:03:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-28 02:03:05,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:05,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:05,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:05,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have 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:03:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2022-04-28 02:03:05,211 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2022-04-28 02:03:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:05,211 INFO L495 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2022-04-28 02:03:05,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2022-04-28 02:03:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:03:05,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:05,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:05,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 02:03:05,215 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:05,215 INFO L85 PathProgramCache]: Analyzing trace with hash -424384310, now seen corresponding path program 1 times [2022-04-28 02:03:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:05,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288376681] [2022-04-28 02:03:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:05,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {53748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {53742#true} is VALID [2022-04-28 02:03:05,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {53742#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53742#true} is VALID [2022-04-28 02:03:05,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53742#true} {53742#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {53742#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:05,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {53748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {53742#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53742#true} {53742#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {53742#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {53742#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {53742#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {53742#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {53742#true} [200] L63-->L63-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[] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {53742#true} [202] L63-2-->L67-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[] {53742#true} is VALID [2022-04-28 02:03:05,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {53742#true} [204] L67-1-->L71-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[] {53742#true} is VALID [2022-04-28 02:03:05,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {53742#true} [206] L71-1-->L75-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[] {53742#true} is VALID [2022-04-28 02:03:05,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {53742#true} [208] L75-1-->L79-1: Formula: (= 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[] {53742#true} is VALID [2022-04-28 02:03:05,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {53742#true} [210] L79-1-->L83-1: Formula: (= 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[] {53742#true} is VALID [2022-04-28 02:03:05,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {53742#true} [212] L83-1-->L87-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[] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {53747#(= main_~p7~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {53747#(= main_~p7~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {53747#(= main_~p7~0 0)} [218] L95-1-->L101-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[] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {53747#(= main_~p7~0 0)} [222] L101-1-->L106-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[] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {53747#(= main_~p7~0 0)} [228] L106-1-->L111-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[] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {53747#(= main_~p7~0 0)} [232] L111-1-->L116-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[] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {53747#(= main_~p7~0 0)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {53747#(= main_~p7~0 0)} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {53747#(= main_~p7~0 0)} is VALID [2022-04-28 02:03:05,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {53747#(= main_~p7~0 0)} [243] L126-1-->L132: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {53743#false} is VALID [2022-04-28 02:03:05,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {53743#false} [245] L132-->L142-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[] {53743#false} is VALID [2022-04-28 02:03:05,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {53743#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53743#false} is VALID [2022-04-28 02:03:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:03:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:05,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288376681] [2022-04-28 02:03:05,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288376681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:05,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:05,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:05,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485101331] [2022-04-28 02:03:05,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:03:05,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:05,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:05,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:05,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:05,261 INFO L87 Difference]: Start difference. First operand 2569 states and 3495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:06,422 INFO L93 Difference]: Finished difference Result 5837 states and 7913 transitions. [2022-04-28 02:03:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:06,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:03:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 02:03:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 02:03:06,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-28 02:03:06,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:06,897 INFO L225 Difference]: With dead ends: 5837 [2022-04-28 02:03:06,897 INFO L226 Difference]: Without dead ends: 3339 [2022-04-28 02:03:06,899 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:03:06,900 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:06,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-28 02:03:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2022-04-28 02:03:06,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:06,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have 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:03:06,955 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have 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:03:06,957 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have 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:03:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:07,308 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-28 02:03:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-28 02:03:07,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:07,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:07,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3339 states. [2022-04-28 02:03:07,320 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3339 states. [2022-04-28 02:03:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:07,685 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-28 02:03:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-28 02:03:07,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:07,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:07,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:07,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have 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:03:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2022-04-28 02:03:08,102 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2022-04-28 02:03:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2022-04-28 02:03:08,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2022-04-28 02:03:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 02:03:08,105 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:08,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:08,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 02:03:08,105 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 22424027, now seen corresponding path program 1 times [2022-04-28 02:03:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:08,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315479611] [2022-04-28 02:03:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:08,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {69946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {69940#true} is VALID [2022-04-28 02:03:08,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {69940#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69940#true} is VALID [2022-04-28 02:03:08,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69940#true} {69940#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69940#true} is VALID [2022-04-28 02:03:08,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {69940#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:08,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {69946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {69940#true} is VALID [2022-04-28 02:03:08,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {69940#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69940#true} is VALID [2022-04-28 02:03:08,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69940#true} {69940#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69940#true} is VALID [2022-04-28 02:03:08,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {69940#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {69940#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {69940#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {69940#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {69940#true} [200] L63-->L63-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[] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {69940#true} [202] L63-2-->L67-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[] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {69940#true} [204] L67-1-->L71-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[] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {69940#true} [206] L71-1-->L75-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[] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {69940#true} [208] L75-1-->L79-1: Formula: (= 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[] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {69940#true} [210] L79-1-->L83-1: Formula: (= 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[] {69940#true} is VALID [2022-04-28 02:03:08,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {69940#true} [211] L83-1-->L87-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] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {69945#(not (= main_~p7~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {69945#(not (= main_~p7~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {69945#(not (= main_~p7~0 0))} [218] L95-1-->L101-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[] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {69945#(not (= main_~p7~0 0))} [222] L101-1-->L106-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[] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {69945#(not (= main_~p7~0 0))} [228] L106-1-->L111-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[] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {69945#(not (= main_~p7~0 0))} [232] L111-1-->L116-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[] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {69945#(not (= main_~p7~0 0))} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {69945#(not (= main_~p7~0 0))} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {69945#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:03:08,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {69945#(not (= main_~p7~0 0))} [244] L126-1-->L131-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {69941#false} is VALID [2022-04-28 02:03:08,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {69941#false} [247] L131-1-->L137: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {69941#false} is VALID [2022-04-28 02:03:08,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {69941#false} [249] L137-->L142-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {69941#false} is VALID [2022-04-28 02:03:08,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {69941#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69941#false} is VALID [2022-04-28 02:03:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:03:08,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:08,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315479611] [2022-04-28 02:03:08,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315479611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:08,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:08,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096698538] [2022-04-28 02:03:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:08,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:03:08,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:08,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:08,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:08,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:08,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:08,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:08,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:08,153 INFO L87 Difference]: Start difference. First operand 3337 states and 4423 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:09,029 INFO L93 Difference]: Finished difference Result 5005 states and 6601 transitions. [2022-04-28 02:03:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:09,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:03:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 02:03:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 02:03:09,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 02:03:09,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:09,509 INFO L225 Difference]: With dead ends: 5005 [2022-04-28 02:03:09,509 INFO L226 Difference]: Without dead ends: 3403 [2022-04-28 02:03:09,511 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:03:09,511 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:09,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 85 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-04-28 02:03:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2022-04-28 02:03:09,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:09,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have 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:03:09,564 INFO L74 IsIncluded]: Start isIncluded. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have 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:03:09,567 INFO L87 Difference]: Start difference. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have 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:03:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:09,945 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-28 02:03:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-28 02:03:09,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:09,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:09,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3403 states. [2022-04-28 02:03:09,954 INFO L87 Difference]: Start difference. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3403 states. [2022-04-28 02:03:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:10,327 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-28 02:03:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-28 02:03:10,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:10,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:10,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:10,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have 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:03:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2022-04-28 02:03:10,730 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2022-04-28 02:03:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:10,730 INFO L495 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2022-04-28 02:03:10,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2022-04-28 02:03:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 02:03:10,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:10,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:10,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 02:03:10,732 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash -270978980, now seen corresponding path program 1 times [2022-04-28 02:03:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:10,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030961875] [2022-04-28 02:03:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:10,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:10,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:10,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {85504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {85498#true} is VALID [2022-04-28 02:03:10,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {85498#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85498#true} is VALID [2022-04-28 02:03:10,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85498#true} {85498#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85498#true} is VALID [2022-04-28 02:03:10,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {85498#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {85504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {85498#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85498#true} {85498#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {85498#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {85498#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {85498#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {85498#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {85498#true} [200] L63-->L63-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[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {85498#true} [202] L63-2-->L67-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[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {85498#true} [204] L67-1-->L71-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[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {85498#true} [206] L71-1-->L75-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[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {85498#true} [208] L75-1-->L79-1: Formula: (= 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[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {85498#true} [210] L79-1-->L83-1: Formula: (= 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[] {85498#true} is VALID [2022-04-28 02:03:10,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {85498#true} [212] L83-1-->L87-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[] {85498#true} is VALID [2022-04-28 02:03:10,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {85498#true} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {85503#(= main_~lk8~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {85503#(= main_~lk8~0 1)} [218] L95-1-->L101-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[] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {85503#(= main_~lk8~0 1)} [222] L101-1-->L106-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[] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {85503#(= main_~lk8~0 1)} [228] L106-1-->L111-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[] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {85503#(= main_~lk8~0 1)} [232] L111-1-->L116-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[] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {85503#(= main_~lk8~0 1)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {85503#(= main_~lk8~0 1)} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {85503#(= main_~lk8~0 1)} [244] L126-1-->L131-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {85503#(= main_~lk8~0 1)} [247] L131-1-->L137: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {85503#(= main_~lk8~0 1)} is VALID [2022-04-28 02:03:10,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {85503#(= main_~lk8~0 1)} [249] L137-->L142-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {85499#false} is VALID [2022-04-28 02:03:10,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {85499#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85499#false} is VALID [2022-04-28 02:03:10,759 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:03:10,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:10,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030961875] [2022-04-28 02:03:10,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030961875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:10,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:10,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931597382] [2022-04-28 02:03:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:10,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:03:10,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:10,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:10,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:10,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:10,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:10,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:10,781 INFO L87 Difference]: Start difference. First operand 3401 states and 4423 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:11,921 INFO L93 Difference]: Finished difference Result 5645 states and 7369 transitions. [2022-04-28 02:03:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:11,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:03:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 02:03:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 02:03:11,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 02:03:11,976 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:03:12,945 INFO L225 Difference]: With dead ends: 5645 [2022-04-28 02:03:12,945 INFO L226 Difference]: Without dead ends: 5643 [2022-04-28 02:03:12,946 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:03:12,947 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:12,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-28 02:03:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2022-04-28 02:03:13,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:13,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have 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:03:13,026 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have 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:03:13,029 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have 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:03:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:13,948 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-28 02:03:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-28 02:03:13,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:13,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:13,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 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 5643 states. [2022-04-28 02:03:13,960 INFO L87 Difference]: Start difference. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 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 5643 states. [2022-04-28 02:03:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:14,886 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-28 02:03:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-28 02:03:14,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:14,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:14,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:14,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have 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:03:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2022-04-28 02:03:15,685 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2022-04-28 02:03:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:15,685 INFO L495 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2022-04-28 02:03:15,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2022-04-28 02:03:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 02:03:15,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:15,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:15,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 02:03:15,689 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:15,689 INFO L85 PathProgramCache]: Analyzing trace with hash -141896261, now seen corresponding path program 1 times [2022-04-28 02:03:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305064483] [2022-04-28 02:03:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:15,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:15,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {107974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {107968#true} is VALID [2022-04-28 02:03:15,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {107968#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107968#true} is VALID [2022-04-28 02:03:15,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107968#true} {107968#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107968#true} is VALID [2022-04-28 02:03:15,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {107968#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:15,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {107974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {107968#true} is VALID [2022-04-28 02:03:15,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {107968#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107968#true} is VALID [2022-04-28 02:03:15,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107968#true} {107968#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107968#true} is VALID [2022-04-28 02:03:15,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {107968#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107968#true} is VALID [2022-04-28 02:03:15,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {107968#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {107968#true} is VALID [2022-04-28 02:03:15,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {107968#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {107968#true} is VALID [2022-04-28 02:03:15,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {107968#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {107968#true} is VALID [2022-04-28 02:03:15,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {107968#true} [200] L63-->L63-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[] {107968#true} is VALID [2022-04-28 02:03:15,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {107968#true} [202] L63-2-->L67-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[] {107968#true} is VALID [2022-04-28 02:03:15,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {107968#true} [204] L67-1-->L71-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[] {107968#true} is VALID [2022-04-28 02:03:15,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {107968#true} [206] L71-1-->L75-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[] {107968#true} is VALID [2022-04-28 02:03:15,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {107968#true} [208] L75-1-->L79-1: Formula: (= 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[] {107968#true} is VALID [2022-04-28 02:03:15,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {107968#true} [210] L79-1-->L83-1: Formula: (= 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[] {107968#true} is VALID [2022-04-28 02:03:15,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {107968#true} [212] L83-1-->L87-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[] {107968#true} is VALID [2022-04-28 02:03:15,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {107968#true} [214] L87-1-->L91-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {107973#(= main_~p8~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {107973#(= main_~p8~0 0)} [218] L95-1-->L101-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[] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {107973#(= main_~p8~0 0)} [222] L101-1-->L106-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[] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {107973#(= main_~p8~0 0)} [228] L106-1-->L111-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[] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {107973#(= main_~p8~0 0)} [232] L111-1-->L116-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[] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {107973#(= main_~p8~0 0)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {107973#(= main_~p8~0 0)} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {107973#(= main_~p8~0 0)} [244] L126-1-->L131-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {107973#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:15,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {107973#(= main_~p8~0 0)} [247] L131-1-->L137: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {107969#false} is VALID [2022-04-28 02:03:15,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {107969#false} [249] L137-->L142-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {107969#false} is VALID [2022-04-28 02:03:15,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {107969#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107969#false} is VALID [2022-04-28 02:03:15,721 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:03:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:15,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305064483] [2022-04-28 02:03:15,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305064483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:15,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:15,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899567197] [2022-04-28 02:03:15,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:03:15,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:15,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:15,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:15,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:15,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:15,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:15,736 INFO L87 Difference]: Start difference. First operand 5129 states and 6471 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:19,822 INFO L93 Difference]: Finished difference Result 11533 states and 14409 transitions. [2022-04-28 02:03:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:19,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:03:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-28 02:03:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-28 02:03:19,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-28 02:03:19,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:21,354 INFO L225 Difference]: With dead ends: 11533 [2022-04-28 02:03:21,354 INFO L226 Difference]: Without dead ends: 6539 [2022-04-28 02:03:21,358 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:03:21,358 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:21,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-04-28 02:03:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2022-04-28 02:03:21,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:21,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have 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:03:21,473 INFO L74 IsIncluded]: Start isIncluded. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have 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:03:21,476 INFO L87 Difference]: Start difference. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have 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:03:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:22,934 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-28 02:03:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-28 02:03:22,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:22,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:22,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6539 states. [2022-04-28 02:03:22,947 INFO L87 Difference]: Start difference. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6539 states. [2022-04-28 02:03:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:24,378 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-28 02:03:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-28 02:03:24,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:24,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:24,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:24,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have 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:03:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2022-04-28 02:03:25,989 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2022-04-28 02:03:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:25,989 INFO L495 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2022-04-28 02:03:25,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2022-04-28 02:03:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:03:25,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:25,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 02:03:25,992 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 189619078, now seen corresponding path program 1 times [2022-04-28 02:03:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:25,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946570851] [2022-04-28 02:03:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:26,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:26,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {139788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {139782#true} is VALID [2022-04-28 02:03:26,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {139782#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139782#true} is VALID [2022-04-28 02:03:26,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139782#true} {139782#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139782#true} is VALID [2022-04-28 02:03:26,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {139782#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:26,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {139788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {139782#true} is VALID [2022-04-28 02:03:26,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {139782#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139782#true} is VALID [2022-04-28 02:03:26,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139782#true} {139782#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139782#true} is VALID [2022-04-28 02:03:26,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {139782#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139782#true} is VALID [2022-04-28 02:03:26,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {139782#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {139782#true} is VALID [2022-04-28 02:03:26,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {139782#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {139782#true} is VALID [2022-04-28 02:03:26,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {139782#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {139782#true} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {139782#true} [200] L63-->L63-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[] {139782#true} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {139782#true} [202] L63-2-->L67-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[] {139782#true} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {139782#true} [204] L67-1-->L71-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[] {139782#true} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {139782#true} [206] L71-1-->L75-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[] {139782#true} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {139782#true} [208] L75-1-->L79-1: Formula: (= 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[] {139782#true} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {139782#true} [210] L79-1-->L83-1: Formula: (= 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[] {139782#true} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {139782#true} [212] L83-1-->L87-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[] {139782#true} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {139782#true} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {139787#(not (= main_~p8~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {139787#(not (= main_~p8~0 0))} [218] L95-1-->L101-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[] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {139787#(not (= main_~p8~0 0))} [222] L101-1-->L106-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[] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {139787#(not (= main_~p8~0 0))} [228] L106-1-->L111-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[] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {139787#(not (= main_~p8~0 0))} [232] L111-1-->L116-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[] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {139787#(not (= main_~p8~0 0))} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {139787#(not (= main_~p8~0 0))} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {139787#(not (= main_~p8~0 0))} [244] L126-1-->L131-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {139787#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:03:26,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {139787#(not (= main_~p8~0 0))} [248] L131-1-->L136-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {139783#false} is VALID [2022-04-28 02:03:26,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {139783#false} [251] L136-1-->L142: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {139783#false} is VALID [2022-04-28 02:03:26,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {139783#false} [253] L142-->L142-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {139783#false} is VALID [2022-04-28 02:03:26,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {139783#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139783#false} is VALID [2022-04-28 02:03:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:03:26,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:26,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946570851] [2022-04-28 02:03:26,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946570851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:26,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:26,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:26,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533844674] [2022-04-28 02:03:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:03:26,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:26,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:26,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:26,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:26,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:26,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:26,037 INFO L87 Difference]: Start difference. First operand 6537 states and 7943 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:29,168 INFO L93 Difference]: Finished difference Result 9805 states and 11849 transitions. [2022-04-28 02:03:29,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:29,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:03:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 02:03:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 02:03:29,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 02:03:29,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:30,683 INFO L225 Difference]: With dead ends: 9805 [2022-04-28 02:03:30,684 INFO L226 Difference]: Without dead ends: 6667 [2022-04-28 02:03:30,689 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:03:30,692 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:30,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2022-04-28 02:03:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2022-04-28 02:03:30,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:30,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have 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:03:30,780 INFO L74 IsIncluded]: Start isIncluded. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have 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:03:30,785 INFO L87 Difference]: Start difference. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have 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:03:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:32,146 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-28 02:03:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-28 02:03:32,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:32,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:32,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6667 states. [2022-04-28 02:03:32,162 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6667 states. [2022-04-28 02:03:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:33,657 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-28 02:03:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-28 02:03:33,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:33,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:33,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:33,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have 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:03:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2022-04-28 02:03:35,192 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2022-04-28 02:03:35,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:35,192 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2022-04-28 02:03:35,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2022-04-28 02:03:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:03:35,195 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:35,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:35,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 02:03:35,196 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -103783929, now seen corresponding path program 1 times [2022-04-28 02:03:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:35,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134649498] [2022-04-28 02:03:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:35,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {170258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {170252#true} is VALID [2022-04-28 02:03:35,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {170252#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170252#true} is VALID [2022-04-28 02:03:35,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170252#true} {170252#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170252#true} is VALID [2022-04-28 02:03:35,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {170252#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:35,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {170258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {170252#true} is VALID [2022-04-28 02:03:35,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {170252#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170252#true} is VALID [2022-04-28 02:03:35,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170252#true} {170252#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170252#true} is VALID [2022-04-28 02:03:35,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {170252#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170252#true} is VALID [2022-04-28 02:03:35,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {170252#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {170252#true} is VALID [2022-04-28 02:03:35,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {170252#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {170252#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {170252#true} [200] L63-->L63-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[] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {170252#true} [202] L63-2-->L67-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[] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {170252#true} [204] L67-1-->L71-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[] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {170252#true} [206] L71-1-->L75-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[] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {170252#true} [208] L75-1-->L79-1: Formula: (= 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[] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {170252#true} [210] L79-1-->L83-1: Formula: (= 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[] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {170252#true} [212] L83-1-->L87-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[] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {170252#true} [214] L87-1-->L91-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {170252#true} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {170252#true} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {170257#(= main_~lk9~0 1)} [218] L95-1-->L101-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[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {170257#(= main_~lk9~0 1)} [222] L101-1-->L106-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[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {170257#(= main_~lk9~0 1)} [228] L106-1-->L111-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[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {170257#(= main_~lk9~0 1)} [232] L111-1-->L116-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[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {170257#(= main_~lk9~0 1)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {170257#(= main_~lk9~0 1)} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {170257#(= main_~lk9~0 1)} [244] L126-1-->L131-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {170257#(= main_~lk9~0 1)} [248] L131-1-->L136-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {170257#(= main_~lk9~0 1)} [251] L136-1-->L142: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {170257#(= main_~lk9~0 1)} is VALID [2022-04-28 02:03:35,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {170257#(= main_~lk9~0 1)} [253] L142-->L142-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {170253#false} is VALID [2022-04-28 02:03:35,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {170253#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170253#false} is VALID [2022-04-28 02:03:35,229 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:03:35,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:35,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134649498] [2022-04-28 02:03:35,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134649498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:35,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:35,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116676822] [2022-04-28 02:03:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:35,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:03:35,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:35,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:35,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:35,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:35,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:35,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:35,243 INFO L87 Difference]: Start difference. First operand 6665 states and 7943 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:38,752 INFO L93 Difference]: Finished difference Result 10763 states and 12680 transitions. [2022-04-28 02:03:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:03:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-28 02:03:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-28 02:03:38,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-28 02:03:38,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:42,094 INFO L225 Difference]: With dead ends: 10763 [2022-04-28 02:03:42,094 INFO L226 Difference]: Without dead ends: 10761 [2022-04-28 02:03:42,095 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:03:42,096 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:42,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2022-04-28 02:03:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2022-04-28 02:03:42,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:42,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have 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:03:42,216 INFO L74 IsIncluded]: Start isIncluded. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have 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:03:42,224 INFO L87 Difference]: Start difference. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have 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:03:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:45,699 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-28 02:03:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-28 02:03:45,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:45,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:45,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 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 10761 states. [2022-04-28 02:03:45,722 INFO L87 Difference]: Start difference. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 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 10761 states. [2022-04-28 02:03:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:49,156 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-28 02:03:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-28 02:03:49,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:49,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:49,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:49,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have 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:03:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2022-04-28 02:03:52,132 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2022-04-28 02:03:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:52,132 INFO L495 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2022-04-28 02:03:52,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2022-04-28 02:03:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:03:52,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:52,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:52,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 02:03:52,137 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash 25298790, now seen corresponding path program 1 times [2022-04-28 02:03:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:52,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574601867] [2022-04-28 02:03:52,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:52,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:52,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {213585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {213579#true} is VALID [2022-04-28 02:03:52,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {213579#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213579#true} is VALID [2022-04-28 02:03:52,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213579#true} {213579#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213579#true} is VALID [2022-04-28 02:03:52,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {213579#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {213585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] 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] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {213579#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213579#true} {213579#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {213579#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {213579#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |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|) (<= 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|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_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~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {213579#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {213579#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~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_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, 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_~lk9~0, main_~lk8~0, main_~lk7~0] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {213579#true} [200] L63-->L63-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[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {213579#true} [202] L63-2-->L67-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[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {213579#true} [204] L67-1-->L71-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[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {213579#true} [206] L71-1-->L75-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[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {213579#true} [208] L75-1-->L79-1: Formula: (= 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[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {213579#true} [210] L79-1-->L83-1: Formula: (= 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[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {213579#true} [212] L83-1-->L87-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[] {213579#true} is VALID [2022-04-28 02:03:52,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {213579#true} [214] L87-1-->L91-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {213579#true} is VALID [2022-04-28 02:03:52,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {213579#true} [216] L91-1-->L95-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {213584#(= main_~p9~0 0)} [218] L95-1-->L101-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[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {213584#(= main_~p9~0 0)} [222] L101-1-->L106-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[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {213584#(= main_~p9~0 0)} [228] L106-1-->L111-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[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {213584#(= main_~p9~0 0)} [232] L111-1-->L116-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[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {213584#(= main_~p9~0 0)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {213584#(= main_~p9~0 0)} [240] L121-1-->L126-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {213584#(= main_~p9~0 0)} [244] L126-1-->L131-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {213584#(= main_~p9~0 0)} [248] L131-1-->L136-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {213584#(= main_~p9~0 0)} is VALID [2022-04-28 02:03:52,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {213584#(= main_~p9~0 0)} [251] L136-1-->L142: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {213580#false} is VALID [2022-04-28 02:03:52,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {213580#false} [253] L142-->L142-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {213580#false} is VALID [2022-04-28 02:03:52,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {213580#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213580#false} is VALID [2022-04-28 02:03:52,190 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:03:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:52,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574601867] [2022-04-28 02:03:52,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574601867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:52,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:52,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:52,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924054169] [2022-04-28 02:03:52,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:52,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:03:52,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:52,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:52,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:52,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:52,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:52,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:52,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:52,206 INFO L87 Difference]: Start difference. First operand 10249 states and 11911 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:04:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:04:08,299 INFO L93 Difference]: Finished difference Result 22793 states and 25991 transitions. [2022-04-28 02:04:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:04:08,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:04:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:04:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:04:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 02:04:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:04:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 02:04:08,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 02:04:08,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:04:08,382 INFO L225 Difference]: With dead ends: 22793 [2022-04-28 02:04:08,383 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:04:08,402 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:04:08,403 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:04:08,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 102 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:04:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:04:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:04:08,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:04:08,404 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:04:08,404 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:04:08,404 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:04:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:04:08,404 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:04:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:04:08,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:04:08,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:04:08,405 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:04:08,405 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:04:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:04:08,405 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:04:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:04:08,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:04:08,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:04:08,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:04:08,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:04:08,405 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:04:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:04:08,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 02:04:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:04:08,405 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:04:08,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:04:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:04:08,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:04:08,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:04:08,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 02:04:08,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:04:45,871 WARN L232 SmtUtils]: Spent 37.46s on a formula simplification that was a NOOP. DAG size: 2098 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 02:04:45,917 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:04:45,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:04:45,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:04:45,917 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:04:45,917 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:04:45,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:04:45,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:04:45,917 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 151) the Hoare annotation is: true [2022-04-28 02:04:45,917 INFO L902 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-04-28 02:04:45,917 INFO L902 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-04-28 02:04:45,917 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-04-28 02:04:45,917 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 151) no Hoare annotation was computed. [2022-04-28 02:04:45,917 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2022-04-28 02:04:45,917 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 151) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L895 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-04-28 02:04:45,918 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,919 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-04-28 02:04:45,919 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,919 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-04-28 02:04:45,919 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,919 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-04-28 02:04:45,919 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2022-04-28 02:04:45,919 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-04-28 02:04:45,921 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, 1, 1, 1, 1, 1, 1] [2022-04-28 02:04:45,922 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-28 02:04:45,925 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2022-04-28 02:04:45,926 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-04-28 02:04:45,927 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-04-28 02:04:45,927 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:04:45,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:04:45 BasicIcfg [2022-04-28 02:04:45,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:04:45,932 INFO L158 Benchmark]: Toolchain (without parser) took 110727.71ms. Allocated memory was 190.8MB in the beginning and 369.1MB in the end (delta: 178.3MB). Free memory was 140.2MB in the beginning and 258.1MB in the end (delta: -118.0MB). Peak memory consumption was 250.7MB. Max. memory is 8.0GB. [2022-04-28 02:04:45,932 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 156.4MB in the beginning and 156.3MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:04:45,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.42ms. Allocated memory is still 190.8MB. Free memory was 139.9MB in the beginning and 166.4MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 02:04:45,933 INFO L158 Benchmark]: Boogie Preprocessor took 37.50ms. Allocated memory is still 190.8MB. Free memory was 166.4MB in the beginning and 164.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:04:45,933 INFO L158 Benchmark]: RCFGBuilder took 298.87ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 150.5MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 02:04:45,933 INFO L158 Benchmark]: IcfgTransformer took 56.63ms. Allocated memory is still 190.8MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:04:45,934 INFO L158 Benchmark]: TraceAbstraction took 110153.46ms. Allocated memory was 190.8MB in the beginning and 369.1MB in the end (delta: 178.3MB). Free memory was 148.0MB in the beginning and 258.1MB in the end (delta: -110.2MB). Peak memory consumption was 258.4MB. Max. memory is 8.0GB. [2022-04-28 02:04:45,940 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.09ms. Allocated memory is still 190.8MB. Free memory was 156.4MB in the beginning and 156.3MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.42ms. Allocated memory is still 190.8MB. Free memory was 139.9MB in the beginning and 166.4MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.50ms. Allocated memory is still 190.8MB. Free memory was 166.4MB in the beginning and 164.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 298.87ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 150.5MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 56.63ms. Allocated memory is still 190.8MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 110153.46ms. Allocated memory was 190.8MB in the beginning and 369.1MB in the end (delta: 178.3MB). Free memory was 148.0MB in the beginning and 258.1MB in the end (delta: -110.2MB). Peak memory consumption was 258.4MB. 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: 149]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 110.1s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2874 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2874 mSDsluCounter, 2142 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1370 IncrementalHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1965 mSDtfsCounter, 1370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10249occurred in iteration=24, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 37.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 1259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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: 0 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 02:04:45,968 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...