/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:56:34,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:56:34,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:56:34,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:56:34,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:56:34,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:56:34,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:56:34,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:56:34,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:56:34,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:56:34,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:56:34,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:56:34,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:56:34,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:56:34,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:56:34,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:56:34,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:56:34,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:56:34,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:56:34,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:56:34,847 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:56:34,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:56:34,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:56:34,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:56:34,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:56:34,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:56:34,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:56:34,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:56:34,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:56:34,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:56:34,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:56:34,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:56:34,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:56:34,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:56:34,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:56:34,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:56:34,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:56:34,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:56:34,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:56:34,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:56:34,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:56:34,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:56:34,868 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:56:34,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:56:34,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:56:34,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:56:34,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:56:34,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:56:34,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:56:34,893 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:56:34,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:56:34,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:56:34,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:56:34,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:56:34,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:56:34,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:56:34,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:56:34,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:56:34,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:56:34,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:56:34,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:56:34,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:56:34,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:56:34,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:56:34,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:56:34,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:56:34,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:56:34,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:56:34,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:56:34,895 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:56:34,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:56:34,899 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:56:34,899 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-08 02:56:35,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:56:35,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:56:35,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:56:35,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:56:35,105 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:56:35,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-08 02:56:35,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458d45015/9d33d38f1c314770b7c592edcb6f883d/FLAG67f5a8e86 [2022-04-08 02:56:35,478 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:56:35,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-08 02:56:35,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458d45015/9d33d38f1c314770b7c592edcb6f883d/FLAG67f5a8e86 [2022-04-08 02:56:35,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458d45015/9d33d38f1c314770b7c592edcb6f883d [2022-04-08 02:56:35,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:56:35,905 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:56:35,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:56:35,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:56:35,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:56:35,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:35" (1/1) ... [2022-04-08 02:56:35,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22650b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:35, skipping insertion in model container [2022-04-08 02:56:35,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:35" (1/1) ... [2022-04-08 02:56:35,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:56:35,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:56:36,104 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_6.c[2544,2557] [2022-04-08 02:56:36,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:56:36,111 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:56:36,140 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_6.c[2544,2557] [2022-04-08 02:56:36,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:56:36,149 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:56:36,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36 WrapperNode [2022-04-08 02:56:36,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:56:36,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:56:36,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:56:36,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:56:36,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:56:36,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:56:36,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:56:36,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:56:36,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:56:36,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:56:36,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 02:56:36,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 02:56:36,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:56:36,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:56:36,259 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:56:36,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:56:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:56:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:56:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:56:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:56:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 02:56:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:56:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:56:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:56:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:56:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:56:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:56:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:56:36,308 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:56:36,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:56:36,498 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:56:36,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:56:36,505 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:56:36,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:36 BoogieIcfgContainer [2022-04-08 02:56:36,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:56:36,506 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:56:36,507 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:56:36,507 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:56:36,509 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:36" (1/1) ... [2022-04-08 02:56:36,510 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:56:36,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:56:36 BasicIcfg [2022-04-08 02:56:36,540 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:56:36,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:56:36,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:56:36,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:56:36,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:56:35" (1/4) ... [2022-04-08 02:56:36,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3854a768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:36, skipping insertion in model container [2022-04-08 02:56:36,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:36" (2/4) ... [2022-04-08 02:56:36,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3854a768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:36, skipping insertion in model container [2022-04-08 02:56:36,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:36" (3/4) ... [2022-04-08 02:56:36,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3854a768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:56:36, skipping insertion in model container [2022-04-08 02:56:36,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:56:36" (4/4) ... [2022-04-08 02:56:36,545 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.cqvasr [2022-04-08 02:56:36,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:56:36,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:56:36,592 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:56:36,597 INFO L340 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 [2022-04-08 02:56:36,597 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:56:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:56:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 02:56:36,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:36,625 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:36,625 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1293324729, now seen corresponding path program 1 times [2022-04-08 02:56:36,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:36,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993940819] [2022-04-08 02:56:36,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:36,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:36,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {36#true} is VALID [2022-04-08 02:56:36,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-08 02:56:36,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-08 02:56:36,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:36,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {36#true} is VALID [2022-04-08 02:56:36,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-08 02:56:36,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-08 02:56:36,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-08 02:56:36,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {36#true} is VALID [2022-04-08 02:56:36,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {36#true} is VALID [2022-04-08 02:56:36,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {36#true} is VALID [2022-04-08 02:56:36,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} [148] L48-->L48-2: Formula: (and (not (= v_main_~p1~0_3 0)) (= v_main_~lk1~0_5 1)) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3, main_~lk1~0=v_main_~lk1~0_5} AuxVars[] AssignedVars[main_~lk1~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:36,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#(= main_~lk1~0 1)} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:36,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#(= main_~lk1~0 1)} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:36,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(= main_~lk1~0 1)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:36,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(= main_~lk1~0 1)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:36,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#(= main_~lk1~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:36,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(= main_~lk1~0 1)} [160] L68-1-->L75: Formula: (not (= 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[] {41#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:36,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} [162] L75-->L100-1: Formula: (not (= v_main_~lk1~0_6 1)) InVars {main_~lk1~0=v_main_~lk1~0_6} OutVars{main_~lk1~0=v_main_~lk1~0_6} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-08 02:56:36,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-08 02:56:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993940819] [2022-04-08 02:56:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993940819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:36,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:36,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177164975] [2022-04-08 02:56:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:36,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-08 02:56:36,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:36,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:36,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:36,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:36,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:36,914 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,122 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-04-08 02:56:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-08 02:56:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 02:56:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 02:56:37,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 02:56:37,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:37,210 INFO L225 Difference]: With dead ends: 64 [2022-04-08 02:56:37,233 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 02:56:37,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:37,238 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:37,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 02:56:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-08 02:56:37,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:37,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,260 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,260 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,264 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-08 02:56:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-08 02:56:37,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:37,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:37,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 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 49 states. [2022-04-08 02:56:37,265 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 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 49 states. [2022-04-08 02:56:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,268 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-08 02:56:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-08 02:56:37,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:37,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:37,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:37,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-08 02:56:37,271 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-08 02:56:37,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:37,272 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-08 02:56:37,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-08 02:56:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 02:56:37,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:37,272 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:37,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:56:37,273 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1194188104, now seen corresponding path program 1 times [2022-04-08 02:56:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:37,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936469089] [2022-04-08 02:56:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:37,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:37,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {263#true} is VALID [2022-04-08 02:56:37,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {263#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-08 02:56:37,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {263#true} {263#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-08 02:56:37,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {263#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:37,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {263#true} is VALID [2022-04-08 02:56:37,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {263#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-08 02:56:37,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-08 02:56:37,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {263#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#true} is VALID [2022-04-08 02:56:37,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {263#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {263#true} is VALID [2022-04-08 02:56:37,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {263#true} is VALID [2022-04-08 02:56:37,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {263#true} is VALID [2022-04-08 02:56:37,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#true} [149] L48-->L48-2: Formula: (= 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[] {268#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:37,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(= main_~p1~0 0)} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {268#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:37,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {268#(= main_~p1~0 0)} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {268#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:37,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(= main_~p1~0 0)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {268#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:37,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {268#(= main_~p1~0 0)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {268#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:37,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {268#(= main_~p1~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {268#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:37,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(= main_~p1~0 0)} [160] L68-1-->L75: Formula: (not (= 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[] {264#false} is VALID [2022-04-08 02:56:37,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {264#false} [162] L75-->L100-1: Formula: (not (= v_main_~lk1~0_6 1)) InVars {main_~lk1~0=v_main_~lk1~0_6} OutVars{main_~lk1~0=v_main_~lk1~0_6} AuxVars[] AssignedVars[] {264#false} is VALID [2022-04-08 02:56:37,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#false} is VALID [2022-04-08 02:56:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:37,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936469089] [2022-04-08 02:56:37,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936469089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:37,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:37,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126482283] [2022-04-08 02:56:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-08 02:56:37,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:37,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:37,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:37,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:37,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:37,338 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,462 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-04-08 02:56:37,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:37,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-04-08 02:56:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-08 02:56:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-08 02:56:37,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-04-08 02:56:37,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:37,551 INFO L225 Difference]: With dead ends: 78 [2022-04-08 02:56:37,551 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 02:56:37,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:37,552 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:37,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 02:56:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-08 02:56:37,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:37,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,556 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,557 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,559 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-08 02:56:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-08 02:56:37,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:37,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:37,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 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 49 states. [2022-04-08 02:56:37,560 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 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 49 states. [2022-04-08 02:56:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,562 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-08 02:56:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-08 02:56:37,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:37,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:37,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:37,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-08 02:56:37,564 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-08 02:56:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:37,564 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-08 02:56:37,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-08 02:56:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 02:56:37,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:37,565 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:37,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 02:56:37,565 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1438328994, now seen corresponding path program 1 times [2022-04-08 02:56:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:37,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232826001] [2022-04-08 02:56:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:37,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {515#true} is VALID [2022-04-08 02:56:37,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-08 02:56:37,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {515#true} {515#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-08 02:56:37,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {515#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:37,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {515#true} is VALID [2022-04-08 02:56:37,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-08 02:56:37,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-08 02:56:37,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {515#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-08 02:56:37,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {515#true} is VALID [2022-04-08 02:56:37,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {515#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {515#true} is VALID [2022-04-08 02:56:37,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {515#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {515#true} is VALID [2022-04-08 02:56:37,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {515#true} [148] L48-->L48-2: Formula: (and (not (= v_main_~p1~0_3 0)) (= v_main_~lk1~0_5 1)) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3, main_~lk1~0=v_main_~lk1~0_5} AuxVars[] AssignedVars[main_~lk1~0] {520#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:37,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {520#(not (= main_~p1~0 0))} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {520#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:37,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#(not (= main_~p1~0 0))} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {520#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:37,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {520#(not (= main_~p1~0 0))} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {520#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:37,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {520#(not (= main_~p1~0 0))} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {520#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:37,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {520#(not (= main_~p1~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {520#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:37,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#(not (= main_~p1~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-08 02:56:37,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {516#false} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-08 02:56:37,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {516#false} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-08 02:56:37,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-08 02:56:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232826001] [2022-04-08 02:56:37,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232826001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:37,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:37,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527676125] [2022-04-08 02:56:37,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:37,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 02:56:37,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:37,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:37,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:37,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:37,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:37,624 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,718 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-08 02:56:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:37,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 02:56:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 02:56:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 02:56:37,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 02:56:37,797 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-08 02:56:37,798 INFO L225 Difference]: With dead ends: 73 [2022-04-08 02:56:37,798 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 02:56:37,798 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:37,799 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:37,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 02:56:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-08 02:56:37,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:37,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,804 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,804 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,806 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-08 02:56:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-08 02:56:37,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:37,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:37,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 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 52 states. [2022-04-08 02:56:37,806 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 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 52 states. [2022-04-08 02:56:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,808 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-08 02:56:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-08 02:56:37,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:37,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:37,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:37,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-08 02:56:37,810 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-08 02:56:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:37,810 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-08 02:56:37,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-08 02:56:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 02:56:37,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:37,811 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:37,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 02:56:37,811 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:37,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1634842499, now seen corresponding path program 1 times [2022-04-08 02:56:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:37,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379291538] [2022-04-08 02:56:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:37,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {773#true} is VALID [2022-04-08 02:56:37,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#true} is VALID [2022-04-08 02:56:37,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {773#true} {773#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#true} is VALID [2022-04-08 02:56:37,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {773#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:37,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {773#true} is VALID [2022-04-08 02:56:37,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {773#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#true} is VALID [2022-04-08 02:56:37,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {773#true} {773#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#true} is VALID [2022-04-08 02:56:37,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {773#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#true} is VALID [2022-04-08 02:56:37,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {773#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {773#true} is VALID [2022-04-08 02:56:37,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {773#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {773#true} is VALID [2022-04-08 02:56:37,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {773#true} is VALID [2022-04-08 02:56:37,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#true} [149] L48-->L48-2: Formula: (= 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[] {773#true} is VALID [2022-04-08 02:56:37,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#true} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {778#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:37,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(= main_~lk2~0 1)} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {778#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:37,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(= main_~lk2~0 1)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {778#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:37,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#(= main_~lk2~0 1)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {778#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:37,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#(= main_~lk2~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {778#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:37,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {778#(= main_~lk2~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {778#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:37,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {778#(= main_~lk2~0 1)} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {778#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:37,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#(= main_~lk2~0 1)} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {774#false} is VALID [2022-04-08 02:56:37,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {774#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {774#false} is VALID [2022-04-08 02:56:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:37,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:37,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379291538] [2022-04-08 02:56:37,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379291538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:37,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:37,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761383074] [2022-04-08 02:56:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 02:56:37,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:37,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:37,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:37,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:37,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:37,879 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,973 INFO L93 Difference]: Finished difference Result 89 states and 145 transitions. [2022-04-08 02:56:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:37,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 02:56:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-08 02:56:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-08 02:56:37,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-08 02:56:38,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:38,040 INFO L225 Difference]: With dead ends: 89 [2022-04-08 02:56:38,040 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 02:56:38,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:38,041 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 93 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:38,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 53 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 02:56:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2022-04-08 02:56:38,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:38,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,048 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,049 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,051 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2022-04-08 02:56:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 142 transitions. [2022-04-08 02:56:38,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:38,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:38,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (2), 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 87 states. [2022-04-08 02:56:38,052 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (2), 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 87 states. [2022-04-08 02:56:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,055 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2022-04-08 02:56:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 142 transitions. [2022-04-08 02:56:38,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:38,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:38,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:38,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 105 transitions. [2022-04-08 02:56:38,057 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 105 transitions. Word has length 18 [2022-04-08 02:56:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:38,057 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 105 transitions. [2022-04-08 02:56:38,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 105 transitions. [2022-04-08 02:56:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 02:56:38,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:38,058 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:38,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 02:56:38,059 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 852670334, now seen corresponding path program 1 times [2022-04-08 02:56:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:38,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907396258] [2022-04-08 02:56:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:38,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {1139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {1133#true} is VALID [2022-04-08 02:56:38,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1133#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-08 02:56:38,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1133#true} {1133#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-08 02:56:38,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {1133#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:38,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {1133#true} is VALID [2022-04-08 02:56:38,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1133#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-08 02:56:38,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1133#true} {1133#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-08 02:56:38,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {1133#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-08 02:56:38,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {1133#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {1133#true} is VALID [2022-04-08 02:56:38,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {1133#true} is VALID [2022-04-08 02:56:38,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {1133#true} is VALID [2022-04-08 02:56:38,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#true} [149] L48-->L48-2: Formula: (= 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[] {1133#true} is VALID [2022-04-08 02:56:38,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {1133#true} [151] L48-2-->L52-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[] {1138#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:38,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {1138#(= main_~p2~0 0)} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1138#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:38,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {1138#(= main_~p2~0 0)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1138#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:38,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {1138#(= main_~p2~0 0)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1138#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:38,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {1138#(= main_~p2~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1138#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:38,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {1138#(= main_~p2~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {1138#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:38,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {1138#(= main_~p2~0 0)} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {1134#false} is VALID [2022-04-08 02:56:38,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {1134#false} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {1134#false} is VALID [2022-04-08 02:56:38,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {1134#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1134#false} is VALID [2022-04-08 02:56:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:38,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:38,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907396258] [2022-04-08 02:56:38,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907396258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:38,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:38,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:38,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385888220] [2022-04-08 02:56:38,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 02:56:38,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:38,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:38,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:38,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:38,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:38,111 INFO L87 Difference]: Start difference. First operand 65 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,205 INFO L93 Difference]: Finished difference Result 145 states and 239 transitions. [2022-04-08 02:56:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:38,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 02:56:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-08 02:56:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-08 02:56:38,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-04-08 02:56:38,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:38,288 INFO L225 Difference]: With dead ends: 145 [2022-04-08 02:56:38,288 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 02:56:38,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:38,289 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:38,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 65 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 02:56:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-08 02:56:38,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:38,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,295 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,295 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,297 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2022-04-08 02:56:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2022-04-08 02:56:38,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:38,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:38,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 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 89 states. [2022-04-08 02:56:38,298 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 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 89 states. [2022-04-08 02:56:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,301 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2022-04-08 02:56:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2022-04-08 02:56:38,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:38,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:38,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:38,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-08 02:56:38,303 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-08 02:56:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:38,304 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-08 02:56:38,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-08 02:56:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 02:56:38,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:38,304 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:38,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 02:56:38,305 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 859522148, now seen corresponding path program 1 times [2022-04-08 02:56:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:38,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612244489] [2022-04-08 02:56:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:38,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {1585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {1579#true} is VALID [2022-04-08 02:56:38,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#true} is VALID [2022-04-08 02:56:38,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1579#true} {1579#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#true} is VALID [2022-04-08 02:56:38,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {1579#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:38,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {1579#true} is VALID [2022-04-08 02:56:38,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#true} is VALID [2022-04-08 02:56:38,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#true} is VALID [2022-04-08 02:56:38,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {1579#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1579#true} is VALID [2022-04-08 02:56:38,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {1579#true} is VALID [2022-04-08 02:56:38,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {1579#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {1579#true} is VALID [2022-04-08 02:56:38,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {1579#true} is VALID [2022-04-08 02:56:38,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#true} [149] L48-->L48-2: Formula: (= 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[] {1579#true} is VALID [2022-04-08 02:56:38,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#true} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {1584#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:38,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {1584#(not (= main_~p2~0 0))} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1584#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:38,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {1584#(not (= main_~p2~0 0))} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1584#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:38,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {1584#(not (= main_~p2~0 0))} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1584#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:38,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {1584#(not (= main_~p2~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1584#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:38,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {1584#(not (= main_~p2~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {1584#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:56:38,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {1584#(not (= main_~p2~0 0))} [165] L74-1-->L79-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[] {1580#false} is VALID [2022-04-08 02:56:38,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#false} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1580#false} is VALID [2022-04-08 02:56:38,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {1580#false} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {1580#false} is VALID [2022-04-08 02:56:38,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {1580#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1580#false} is VALID [2022-04-08 02:56:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:38,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612244489] [2022-04-08 02:56:38,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612244489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:38,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:38,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530444878] [2022-04-08 02:56:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:38,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:38,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:38,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:38,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:38,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:38,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:38,375 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,492 INFO L93 Difference]: Finished difference Result 130 states and 206 transitions. [2022-04-08 02:56:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-08 02:56:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-08 02:56:38,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-04-08 02:56:38,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:38,567 INFO L225 Difference]: With dead ends: 130 [2022-04-08 02:56:38,567 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 02:56:38,567 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:38,568 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:38,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 70 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 02:56:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-08 02:56:38,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:38,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,572 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,572 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,574 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2022-04-08 02:56:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2022-04-08 02:56:38,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:38,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:38,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-08 02:56:38,575 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-08 02:56:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,577 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2022-04-08 02:56:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2022-04-08 02:56:38,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:38,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:38,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:38,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2022-04-08 02:56:38,579 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 19 [2022-04-08 02:56:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:38,579 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-04-08 02:56:38,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2022-04-08 02:56:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 02:56:38,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:38,579 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:38,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 02:56:38,580 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash 663008643, now seen corresponding path program 1 times [2022-04-08 02:56:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:38,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462077928] [2022-04-08 02:56:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:38,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:38,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {2022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {2016#true} is VALID [2022-04-08 02:56:38,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2016#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2016#true} is VALID [2022-04-08 02:56:38,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2016#true} {2016#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2016#true} is VALID [2022-04-08 02:56:38,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {2016#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:38,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {2016#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2016#true} {2016#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {2016#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {2016#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {2016#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {2016#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {2016#true} [149] L48-->L48-2: Formula: (= 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[] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#true} [151] L48-2-->L52-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[] {2016#true} is VALID [2022-04-08 02:56:38,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {2016#true} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {2021#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:38,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {2021#(= main_~lk3~0 1)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2021#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:38,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {2021#(= main_~lk3~0 1)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2021#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:38,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {2021#(= main_~lk3~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2021#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:38,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {2021#(= main_~lk3~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {2021#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:38,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {2021#(= main_~lk3~0 1)} [165] L74-1-->L79-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[] {2021#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:38,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {2021#(= main_~lk3~0 1)} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {2021#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:38,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {2021#(= main_~lk3~0 1)} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {2017#false} is VALID [2022-04-08 02:56:38,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2017#false} is VALID [2022-04-08 02:56:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:38,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:38,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462077928] [2022-04-08 02:56:38,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462077928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:38,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:38,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:38,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437915826] [2022-04-08 02:56:38,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:38,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:38,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:38,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:38,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:38,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:38,637 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,744 INFO L93 Difference]: Finished difference Result 157 states and 249 transitions. [2022-04-08 02:56:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:38,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-08 02:56:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-08 02:56:38,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-08 02:56:38,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:38,798 INFO L225 Difference]: With dead ends: 157 [2022-04-08 02:56:38,798 INFO L226 Difference]: Without dead ends: 155 [2022-04-08 02:56:38,798 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:38,799 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:38,799 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-08 02:56:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2022-04-08 02:56:38,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:38,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,804 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,804 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,807 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2022-04-08 02:56:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2022-04-08 02:56:38,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:38,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:38,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 2 states have call successors, (2), 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 155 states. [2022-04-08 02:56:38,808 INFO L87 Difference]: Start difference. First operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 2 states have call successors, (2), 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 155 states. [2022-04-08 02:56:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,811 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2022-04-08 02:56:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2022-04-08 02:56:38,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:38,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:38,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:38,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2022-04-08 02:56:38,814 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 19 [2022-04-08 02:56:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:38,814 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2022-04-08 02:56:38,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2022-04-08 02:56:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 02:56:38,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:38,814 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:38,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 02:56:38,815 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:38,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1144445820, now seen corresponding path program 1 times [2022-04-08 02:56:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:38,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575359097] [2022-04-08 02:56:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:38,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {2648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {2642#true} is VALID [2022-04-08 02:56:38,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {2642#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2642#true} is VALID [2022-04-08 02:56:38,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2642#true} {2642#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2642#true} is VALID [2022-04-08 02:56:38,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {2642#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:38,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {2648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {2642#true} is VALID [2022-04-08 02:56:38,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {2642#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2642#true} is VALID [2022-04-08 02:56:38,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2642#true} {2642#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2642#true} is VALID [2022-04-08 02:56:38,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {2642#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2642#true} is VALID [2022-04-08 02:56:38,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {2642#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {2642#true} is VALID [2022-04-08 02:56:38,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {2642#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {2642#true} is VALID [2022-04-08 02:56:38,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {2642#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {2642#true} is VALID [2022-04-08 02:56:38,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {2642#true} [149] L48-->L48-2: Formula: (= 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[] {2642#true} is VALID [2022-04-08 02:56:38,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {2642#true} [151] L48-2-->L52-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[] {2642#true} is VALID [2022-04-08 02:56:38,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {2642#true} [153] L52-1-->L56-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[] {2647#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:38,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {2647#(= main_~p3~0 0)} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2647#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:38,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {2647#(= main_~p3~0 0)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2647#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:38,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {2647#(= main_~p3~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2647#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:38,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {2647#(= main_~p3~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {2647#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:38,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {2647#(= main_~p3~0 0)} [165] L74-1-->L79-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[] {2647#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:38,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {2647#(= main_~p3~0 0)} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {2643#false} is VALID [2022-04-08 02:56:38,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {2643#false} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {2643#false} is VALID [2022-04-08 02:56:38,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {2643#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2643#false} is VALID [2022-04-08 02:56:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:38,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:38,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575359097] [2022-04-08 02:56:38,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575359097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:38,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:38,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658416245] [2022-04-08 02:56:38,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:38,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:38,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:38,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:38,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:38,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:38,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:38,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:38,859 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:38,949 INFO L93 Difference]: Finished difference Result 273 states and 425 transitions. [2022-04-08 02:56:38,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:38,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 02:56:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-08 02:56:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-08 02:56:38,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-08 02:56:39,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:39,027 INFO L225 Difference]: With dead ends: 273 [2022-04-08 02:56:39,027 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 02:56:39,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:39,028 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:39,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 02:56:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-04-08 02:56:39,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:39,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,033 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,033 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,036 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2022-04-08 02:56:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2022-04-08 02:56:39,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 2 states have call successors, (2), 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 163 states. [2022-04-08 02:56:39,037 INFO L87 Difference]: Start difference. First operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 2 states have call successors, (2), 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 163 states. [2022-04-08 02:56:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,040 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2022-04-08 02:56:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2022-04-08 02:56:39,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:39,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 243 transitions. [2022-04-08 02:56:39,043 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 243 transitions. Word has length 19 [2022-04-08 02:56:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:39,043 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 243 transitions. [2022-04-08 02:56:39,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 243 transitions. [2022-04-08 02:56:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:56:39,044 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:39,044 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:39,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 02:56:39,044 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash -921536358, now seen corresponding path program 1 times [2022-04-08 02:56:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:39,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204103134] [2022-04-08 02:56:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:39,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {3454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {3448#true} is VALID [2022-04-08 02:56:39,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {3448#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3448#true} is VALID [2022-04-08 02:56:39,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3448#true} {3448#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3448#true} is VALID [2022-04-08 02:56:39,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {3448#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:39,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {3448#true} is VALID [2022-04-08 02:56:39,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {3448#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3448#true} is VALID [2022-04-08 02:56:39,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3448#true} is VALID [2022-04-08 02:56:39,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {3448#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3448#true} is VALID [2022-04-08 02:56:39,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {3448#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {3448#true} is VALID [2022-04-08 02:56:39,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {3448#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {3448#true} is VALID [2022-04-08 02:56:39,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {3448#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {3448#true} is VALID [2022-04-08 02:56:39,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {3448#true} [149] L48-->L48-2: Formula: (= 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[] {3448#true} is VALID [2022-04-08 02:56:39,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {3448#true} [151] L48-2-->L52-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[] {3448#true} is VALID [2022-04-08 02:56:39,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {3448#true} [152] L52-1-->L56-1: Formula: (and (= v_main_~lk3~0_6 1) (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, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {3453#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:39,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {3453#(not (= main_~p3~0 0))} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3453#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:39,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {3453#(not (= main_~p3~0 0))} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3453#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:39,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {3453#(not (= main_~p3~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3453#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:39,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {3453#(not (= main_~p3~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {3453#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:39,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {3453#(not (= main_~p3~0 0))} [165] L74-1-->L79-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[] {3453#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:39,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {3453#(not (= main_~p3~0 0))} [171] L79-1-->L84-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[] {3449#false} is VALID [2022-04-08 02:56:39,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {3449#false} [174] L84-1-->L90: Formula: (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} AuxVars[] AssignedVars[] {3449#false} is VALID [2022-04-08 02:56:39,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {3449#false} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {3449#false} is VALID [2022-04-08 02:56:39,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {3449#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3449#false} is VALID [2022-04-08 02:56:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:39,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204103134] [2022-04-08 02:56:39,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204103134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:39,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:39,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806118430] [2022-04-08 02:56:39,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:39,084 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-08 02:56:39,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:39,084 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-08 02:56:39,094 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-08 02:56:39,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:39,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:39,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:39,094 INFO L87 Difference]: Start difference. First operand 161 states and 243 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-08 02:56:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,195 INFO L93 Difference]: Finished difference Result 241 states and 361 transitions. [2022-04-08 02:56:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:39,195 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-08 02:56:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:39,195 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-08 02:56:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-08 02:56:39,201 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-08 02:56:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-08 02:56:39,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-08 02:56:39,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:39,264 INFO L225 Difference]: With dead ends: 241 [2022-04-08 02:56:39,264 INFO L226 Difference]: Without dead ends: 167 [2022-04-08 02:56:39,264 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:39,265 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:39,265 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-08 02:56:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-08 02:56:39,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:39,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,270 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,270 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,272 INFO L93 Difference]: Finished difference Result 167 states and 244 transitions. [2022-04-08 02:56:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2022-04-08 02:56:39,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 2 states have call successors, (2), 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 167 states. [2022-04-08 02:56:39,273 INFO L87 Difference]: Start difference. First operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 2 states have call successors, (2), 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 167 states. [2022-04-08 02:56:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,275 INFO L93 Difference]: Finished difference Result 167 states and 244 transitions. [2022-04-08 02:56:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2022-04-08 02:56:39,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:39,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2022-04-08 02:56:39,278 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 20 [2022-04-08 02:56:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:39,278 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2022-04-08 02:56:39,278 INFO L479 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-08 02:56:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2022-04-08 02:56:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:56:39,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:39,278 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:39,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 02:56:39,278 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1118049863, now seen corresponding path program 1 times [2022-04-08 02:56:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:39,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005230636] [2022-04-08 02:56:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:39,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:39,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {4234#true} is VALID [2022-04-08 02:56:39,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {4234#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4234#true} is VALID [2022-04-08 02:56:39,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4234#true} {4234#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {4234#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:39,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {4234#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4234#true} {4234#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {4234#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {4234#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {4234#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {4234#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {4234#true} [149] L48-->L48-2: Formula: (= 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[] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {4234#true} [151] L48-2-->L52-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[] {4234#true} is VALID [2022-04-08 02:56:39,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {4234#true} [153] L52-1-->L56-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[] {4234#true} is VALID [2022-04-08 02:56:39,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {4234#true} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {4239#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:39,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {4239#(= main_~lk4~0 1)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {4239#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:39,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {4239#(= main_~lk4~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {4239#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:39,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {4239#(= main_~lk4~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {4239#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:39,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {4239#(= main_~lk4~0 1)} [165] L74-1-->L79-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[] {4239#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:39,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {4239#(= main_~lk4~0 1)} [171] L79-1-->L84-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[] {4239#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:39,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {4239#(= main_~lk4~0 1)} [174] L84-1-->L90: Formula: (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} AuxVars[] AssignedVars[] {4239#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:39,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {4239#(= main_~lk4~0 1)} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {4235#false} is VALID [2022-04-08 02:56:39,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {4235#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4235#false} is VALID [2022-04-08 02:56:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:39,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:39,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005230636] [2022-04-08 02:56:39,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005230636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:39,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:39,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227682069] [2022-04-08 02:56:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:39,310 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-08 02:56:39,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:39,311 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-08 02:56:39,321 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-08 02:56:39,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:39,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:39,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:39,321 INFO L87 Difference]: Start difference. First operand 165 states and 243 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-08 02:56:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,410 INFO L93 Difference]: Finished difference Result 285 states and 425 transitions. [2022-04-08 02:56:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:39,411 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-08 02:56:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:39,411 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-08 02:56:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-08 02:56:39,411 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-08 02:56:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-08 02:56:39,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-08 02:56:39,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:39,460 INFO L225 Difference]: With dead ends: 285 [2022-04-08 02:56:39,460 INFO L226 Difference]: Without dead ends: 283 [2022-04-08 02:56:39,461 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:39,461 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:39,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-08 02:56:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-08 02:56:39,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:39,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,466 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,467 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,471 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2022-04-08 02:56:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2022-04-08 02:56:39,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 2 states have call successors, (2), 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 283 states. [2022-04-08 02:56:39,485 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 2 states have call successors, (2), 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 283 states. [2022-04-08 02:56:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,491 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2022-04-08 02:56:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2022-04-08 02:56:39,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:39,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 335 transitions. [2022-04-08 02:56:39,496 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 335 transitions. Word has length 20 [2022-04-08 02:56:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:39,496 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 335 transitions. [2022-04-08 02:56:39,496 INFO L479 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-08 02:56:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 335 transitions. [2022-04-08 02:56:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:56:39,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:39,497 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:39,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 02:56:39,497 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1369462970, now seen corresponding path program 1 times [2022-04-08 02:56:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:39,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581098202] [2022-04-08 02:56:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:39,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {5374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {5368#true} is VALID [2022-04-08 02:56:39,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {5368#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5368#true} is VALID [2022-04-08 02:56:39,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5368#true} {5368#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5368#true} is VALID [2022-04-08 02:56:39,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {5368#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:39,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {5374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {5368#true} is VALID [2022-04-08 02:56:39,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {5368#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5368#true} is VALID [2022-04-08 02:56:39,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5368#true} {5368#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5368#true} is VALID [2022-04-08 02:56:39,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {5368#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5368#true} is VALID [2022-04-08 02:56:39,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {5368#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {5368#true} is VALID [2022-04-08 02:56:39,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {5368#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {5368#true} is VALID [2022-04-08 02:56:39,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {5368#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {5368#true} is VALID [2022-04-08 02:56:39,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {5368#true} [149] L48-->L48-2: Formula: (= 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[] {5368#true} is VALID [2022-04-08 02:56:39,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {5368#true} [151] L48-2-->L52-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[] {5368#true} is VALID [2022-04-08 02:56:39,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {5368#true} [153] L52-1-->L56-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[] {5368#true} is VALID [2022-04-08 02:56:39,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {5368#true} [155] L56-1-->L60-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[] {5373#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:39,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {5373#(= main_~p4~0 0)} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {5373#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:39,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {5373#(= main_~p4~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {5373#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:39,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {5373#(= main_~p4~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {5373#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:39,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {5373#(= main_~p4~0 0)} [165] L74-1-->L79-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[] {5373#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:39,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {5373#(= main_~p4~0 0)} [171] L79-1-->L84-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[] {5373#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:39,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(= main_~p4~0 0)} [174] L84-1-->L90: Formula: (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} AuxVars[] AssignedVars[] {5369#false} is VALID [2022-04-08 02:56:39,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {5369#false} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {5369#false} is VALID [2022-04-08 02:56:39,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {5369#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5369#false} is VALID [2022-04-08 02:56:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:39,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581098202] [2022-04-08 02:56:39,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581098202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:39,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:39,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931068279] [2022-04-08 02:56:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:39,553 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-08 02:56:39,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:39,553 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-08 02:56:39,563 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-08 02:56:39,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:39,563 INFO L87 Difference]: Start difference. First operand 233 states and 335 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-08 02:56:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,656 INFO L93 Difference]: Finished difference Result 525 states and 753 transitions. [2022-04-08 02:56:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:39,657 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-08 02:56:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:39,657 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-08 02:56:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 02:56:39,658 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-08 02:56:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 02:56:39,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-08 02:56:39,726 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-08 02:56:39,731 INFO L225 Difference]: With dead ends: 525 [2022-04-08 02:56:39,731 INFO L226 Difference]: Without dead ends: 307 [2022-04-08 02:56:39,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:39,732 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:39,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-08 02:56:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-08 02:56:39,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:39,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,740 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,741 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,747 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2022-04-08 02:56:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2022-04-08 02:56:39,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 2 states have call successors, (2), 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 307 states. [2022-04-08 02:56:39,748 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 2 states have call successors, (2), 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 307 states. [2022-04-08 02:56:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,754 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2022-04-08 02:56:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2022-04-08 02:56:39,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:39,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 423 transitions. [2022-04-08 02:56:39,761 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 423 transitions. Word has length 20 [2022-04-08 02:56:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:39,761 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 423 transitions. [2022-04-08 02:56:39,762 INFO L479 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-08 02:56:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 423 transitions. [2022-04-08 02:56:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 02:56:39,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:39,763 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:39,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 02:56:39,763 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash -299775072, now seen corresponding path program 1 times [2022-04-08 02:56:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:39,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54646542] [2022-04-08 02:56:39,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:39,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {6884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {6878#true} is VALID [2022-04-08 02:56:39,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {6878#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6878#true} is VALID [2022-04-08 02:56:39,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6878#true} {6878#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6878#true} is VALID [2022-04-08 02:56:39,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {6878#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:39,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {6884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {6878#true} is VALID [2022-04-08 02:56:39,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {6878#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6878#true} is VALID [2022-04-08 02:56:39,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6878#true} {6878#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6878#true} is VALID [2022-04-08 02:56:39,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {6878#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6878#true} is VALID [2022-04-08 02:56:39,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {6878#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {6878#true} is VALID [2022-04-08 02:56:39,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {6878#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {6878#true} is VALID [2022-04-08 02:56:39,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {6878#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {6878#true} is VALID [2022-04-08 02:56:39,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {6878#true} [149] L48-->L48-2: Formula: (= 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[] {6878#true} is VALID [2022-04-08 02:56:39,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {6878#true} [151] L48-2-->L52-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[] {6878#true} is VALID [2022-04-08 02:56:39,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {6878#true} [153] L52-1-->L56-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[] {6878#true} is VALID [2022-04-08 02:56:39,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {6878#true} [154] L56-1-->L60-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {6883#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:39,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {6883#(not (= main_~p4~0 0))} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {6883#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:39,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {6883#(not (= main_~p4~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {6883#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:39,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {6883#(not (= main_~p4~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {6883#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:39,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {6883#(not (= main_~p4~0 0))} [165] L74-1-->L79-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[] {6883#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:39,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {6883#(not (= main_~p4~0 0))} [171] L79-1-->L84-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[] {6883#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:39,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {6883#(not (= main_~p4~0 0))} [175] L84-1-->L89-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[] {6879#false} is VALID [2022-04-08 02:56:39,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {6879#false} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {6879#false} is VALID [2022-04-08 02:56:39,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {6879#false} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {6879#false} is VALID [2022-04-08 02:56:39,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {6879#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6879#false} is VALID [2022-04-08 02:56:39,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-08 02:56:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54646542] [2022-04-08 02:56:39,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54646542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:39,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:39,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538290355] [2022-04-08 02:56:39,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:39,807 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-08 02:56:39,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:39,808 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-08 02:56:39,818 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-08 02:56:39,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:39,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:39,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:39,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:39,819 INFO L87 Difference]: Start difference. First operand 305 states and 423 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-08 02:56:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,930 INFO L93 Difference]: Finished difference Result 457 states and 629 transitions. [2022-04-08 02:56:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:39,930 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-08 02:56:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:39,930 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-08 02:56:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-08 02:56:39,931 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-08 02:56:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-08 02:56:39,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-08 02:56:39,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:39,999 INFO L225 Difference]: With dead ends: 457 [2022-04-08 02:56:39,999 INFO L226 Difference]: Without dead ends: 315 [2022-04-08 02:56:39,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:40,000 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:40,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-08 02:56:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-08 02:56:40,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:40,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,006 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,007 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,011 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2022-04-08 02:56:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 424 transitions. [2022-04-08 02:56:40,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:40,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:40,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 2 states have call successors, (2), 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 315 states. [2022-04-08 02:56:40,012 INFO L87 Difference]: Start difference. First operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 2 states have call successors, (2), 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 315 states. [2022-04-08 02:56:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,017 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2022-04-08 02:56:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 424 transitions. [2022-04-08 02:56:40,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:40,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:40,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:40,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 423 transitions. [2022-04-08 02:56:40,022 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 423 transitions. Word has length 21 [2022-04-08 02:56:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:40,022 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 423 transitions. [2022-04-08 02:56:40,022 INFO L479 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-08 02:56:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 423 transitions. [2022-04-08 02:56:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 02:56:40,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:40,023 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:40,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 02:56:40,023 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash -496288577, now seen corresponding path program 1 times [2022-04-08 02:56:40,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:40,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093139314] [2022-04-08 02:56:40,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:40,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:40,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:40,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {8350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {8344#true} is VALID [2022-04-08 02:56:40,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {8344#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8344#true} is VALID [2022-04-08 02:56:40,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8344#true} {8344#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8344#true} is VALID [2022-04-08 02:56:40,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {8344#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:40,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {8350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {8344#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8344#true} {8344#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {8344#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {8344#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {8344#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {8344#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {8344#true} [149] L48-->L48-2: Formula: (= 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[] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {8344#true} [151] L48-2-->L52-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[] {8344#true} is VALID [2022-04-08 02:56:40,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {8344#true} [153] L52-1-->L56-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[] {8344#true} is VALID [2022-04-08 02:56:40,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {8344#true} [155] L56-1-->L60-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[] {8344#true} is VALID [2022-04-08 02:56:40,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {8344#true} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {8349#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:40,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {8349#(= main_~lk5~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {8349#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:40,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {8349#(= main_~lk5~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {8349#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:40,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {8349#(= main_~lk5~0 1)} [165] L74-1-->L79-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[] {8349#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:40,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {8349#(= main_~lk5~0 1)} [171] L79-1-->L84-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[] {8349#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:40,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {8349#(= main_~lk5~0 1)} [175] L84-1-->L89-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[] {8349#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:40,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {8349#(= main_~lk5~0 1)} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {8349#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:40,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {8349#(= main_~lk5~0 1)} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {8345#false} is VALID [2022-04-08 02:56:40,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {8345#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8345#false} is VALID [2022-04-08 02:56:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:40,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093139314] [2022-04-08 02:56:40,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093139314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:40,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:40,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:40,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028999988] [2022-04-08 02:56:40,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:40,069 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-08 02:56:40,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:40,069 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-08 02:56:40,081 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-08 02:56:40,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:40,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:40,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:40,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:40,082 INFO L87 Difference]: Start difference. First operand 313 states and 423 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-08 02:56:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,184 INFO L93 Difference]: Finished difference Result 525 states and 713 transitions. [2022-04-08 02:56:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:40,184 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-08 02:56:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:40,184 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-08 02:56:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-08 02:56:40,185 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-08 02:56:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-08 02:56:40,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-08 02:56:40,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:40,239 INFO L225 Difference]: With dead ends: 525 [2022-04-08 02:56:40,239 INFO L226 Difference]: Without dead ends: 523 [2022-04-08 02:56:40,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:40,240 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:40,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-08 02:56:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-08 02:56:40,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:40,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,247 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,248 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,258 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-04-08 02:56:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 696 transitions. [2022-04-08 02:56:40,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:40,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:40,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 2 states have call successors, (2), 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 523 states. [2022-04-08 02:56:40,259 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 2 states have call successors, (2), 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 523 states. [2022-04-08 02:56:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,270 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-04-08 02:56:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 696 transitions. [2022-04-08 02:56:40,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:40,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:40,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:40,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 599 transitions. [2022-04-08 02:56:40,279 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 599 transitions. Word has length 21 [2022-04-08 02:56:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:40,279 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 599 transitions. [2022-04-08 02:56:40,279 INFO L479 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-08 02:56:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 599 transitions. [2022-04-08 02:56:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 02:56:40,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:40,280 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:40,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 02:56:40,280 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1991224256, now seen corresponding path program 1 times [2022-04-08 02:56:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:40,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387718447] [2022-04-08 02:56:40,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:40,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:40,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:40,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {10452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {10446#true} is VALID [2022-04-08 02:56:40,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {10446#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10446#true} is VALID [2022-04-08 02:56:40,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10446#true} {10446#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {10446#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {10452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {10446#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10446#true} {10446#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {10446#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {10446#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {10446#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {10446#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {10446#true} [149] L48-->L48-2: Formula: (= 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[] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {10446#true} [151] L48-2-->L52-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[] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {10446#true} [153] L52-1-->L56-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[] {10446#true} is VALID [2022-04-08 02:56:40,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {10446#true} [155] L56-1-->L60-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[] {10446#true} is VALID [2022-04-08 02:56:40,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {10446#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {10451#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:40,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {10451#(= main_~p5~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {10451#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:40,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {10451#(= main_~p5~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {10451#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:40,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {10451#(= main_~p5~0 0)} [165] L74-1-->L79-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[] {10451#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:40,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {10451#(= main_~p5~0 0)} [171] L79-1-->L84-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[] {10451#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:40,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {10451#(= main_~p5~0 0)} [175] L84-1-->L89-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[] {10451#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:40,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {10451#(= main_~p5~0 0)} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {10447#false} is VALID [2022-04-08 02:56:40,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {10447#false} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {10447#false} is VALID [2022-04-08 02:56:40,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {10447#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10447#false} is VALID [2022-04-08 02:56:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387718447] [2022-04-08 02:56:40,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387718447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:40,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:40,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:40,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776047905] [2022-04-08 02:56:40,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:40,308 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-08 02:56:40,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:40,308 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-08 02:56:40,324 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-08 02:56:40,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:40,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:40,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:40,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:40,325 INFO L87 Difference]: Start difference. First operand 457 states and 599 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-08 02:56:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,479 INFO L93 Difference]: Finished difference Result 1021 states and 1321 transitions. [2022-04-08 02:56:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:40,479 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-08 02:56:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:40,480 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-08 02:56:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 02:56:40,481 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-08 02:56:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 02:56:40,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-08 02:56:40,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:40,562 INFO L225 Difference]: With dead ends: 1021 [2022-04-08 02:56:40,563 INFO L226 Difference]: Without dead ends: 587 [2022-04-08 02:56:40,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:40,565 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:40,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-08 02:56:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-08 02:56:40,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:40,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,582 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,584 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,603 INFO L93 Difference]: Finished difference Result 587 states and 728 transitions. [2022-04-08 02:56:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 728 transitions. [2022-04-08 02:56:40,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:40,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:40,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-08 02:56:40,606 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-08 02:56:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,625 INFO L93 Difference]: Finished difference Result 587 states and 728 transitions. [2022-04-08 02:56:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 728 transitions. [2022-04-08 02:56:40,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:40,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:40,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:40,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 727 transitions. [2022-04-08 02:56:40,646 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 727 transitions. Word has length 21 [2022-04-08 02:56:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:40,646 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 727 transitions. [2022-04-08 02:56:40,646 INFO L479 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-08 02:56:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 727 transitions. [2022-04-08 02:56:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:56:40,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:40,647 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:40,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 02:56:40,647 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1794955734, now seen corresponding path program 1 times [2022-04-08 02:56:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:40,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681326836] [2022-04-08 02:56:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:40,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:40,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {13338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {13332#true} is VALID [2022-04-08 02:56:40,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {13332#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13332#true} is VALID [2022-04-08 02:56:40,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13332#true} {13332#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13332#true} is VALID [2022-04-08 02:56:40,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {13332#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:40,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {13338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {13332#true} is VALID [2022-04-08 02:56:40,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {13332#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13332#true} is VALID [2022-04-08 02:56:40,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13332#true} {13332#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13332#true} is VALID [2022-04-08 02:56:40,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {13332#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13332#true} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {13332#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {13332#true} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {13332#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {13332#true} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {13332#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {13332#true} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {13332#true} [149] L48-->L48-2: Formula: (= 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[] {13332#true} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {13332#true} [151] L48-2-->L52-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[] {13332#true} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {13332#true} [153] L52-1-->L56-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[] {13332#true} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {13332#true} [155] L56-1-->L60-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[] {13332#true} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {13332#true} [156] L60-1-->L64-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {13337#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:40,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {13337#(not (= main_~p5~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {13337#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:40,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {13337#(not (= main_~p5~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {13337#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:40,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {13337#(not (= main_~p5~0 0))} [165] L74-1-->L79-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[] {13337#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:40,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {13337#(not (= main_~p5~0 0))} [171] L79-1-->L84-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[] {13337#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:40,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {13337#(not (= main_~p5~0 0))} [175] L84-1-->L89-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[] {13337#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:40,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {13337#(not (= main_~p5~0 0))} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {13333#false} is VALID [2022-04-08 02:56:40,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {13333#false} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {13333#false} is VALID [2022-04-08 02:56:40,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {13333#false} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {13333#false} is VALID [2022-04-08 02:56:40,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {13333#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13333#false} is VALID [2022-04-08 02:56:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:40,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681326836] [2022-04-08 02:56:40,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681326836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:40,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:40,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:40,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950387938] [2022-04-08 02:56:40,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:40,691 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-08 02:56:40,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:40,691 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-08 02:56:40,702 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-08 02:56:40,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:40,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:40,703 INFO L87 Difference]: Start difference. First operand 585 states and 727 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,809 INFO L93 Difference]: Finished difference Result 877 states and 1081 transitions. [2022-04-08 02:56:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:40,809 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-08 02:56:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:40,809 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-08 02:56:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 02:56:40,810 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-08 02:56:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 02:56:40,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 02:56:40,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:40,879 INFO L225 Difference]: With dead ends: 877 [2022-04-08 02:56:40,879 INFO L226 Difference]: Without dead ends: 603 [2022-04-08 02:56:40,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:40,880 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:40,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-08 02:56:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-08 02:56:40,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:40,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,890 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,891 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,903 INFO L93 Difference]: Finished difference Result 603 states and 728 transitions. [2022-04-08 02:56:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 728 transitions. [2022-04-08 02:56:40,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:40,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:40,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-08 02:56:40,905 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-08 02:56:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:40,917 INFO L93 Difference]: Finished difference Result 603 states and 728 transitions. [2022-04-08 02:56:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 728 transitions. [2022-04-08 02:56:40,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:40,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:40,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:40,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 727 transitions. [2022-04-08 02:56:40,931 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 727 transitions. Word has length 22 [2022-04-08 02:56:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:40,931 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 727 transitions. [2022-04-08 02:56:40,931 INFO L479 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-08 02:56:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 727 transitions. [2022-04-08 02:56:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:56:40,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:40,932 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:40,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 02:56:40,932 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:40,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1598442229, now seen corresponding path program 1 times [2022-04-08 02:56:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:40,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774708796] [2022-04-08 02:56:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:40,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:40,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {16128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {16122#true} is VALID [2022-04-08 02:56:40,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {16122#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16122#true} is VALID [2022-04-08 02:56:40,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16122#true} {16122#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16122#true} is VALID [2022-04-08 02:56:40,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {16122#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {16128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {16122#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16122#true} {16122#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {16122#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {16122#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {16122#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {16122#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {16122#true} [149] L48-->L48-2: Formula: (= 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[] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {16122#true} [151] L48-2-->L52-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[] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {16122#true} [153] L52-1-->L56-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[] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {16122#true} [155] L56-1-->L60-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[] {16122#true} is VALID [2022-04-08 02:56:40,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {16122#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {16122#true} is VALID [2022-04-08 02:56:40,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {16122#true} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {16127#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:40,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {16127#(= main_~lk6~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {16127#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:40,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {16127#(= main_~lk6~0 1)} [165] L74-1-->L79-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[] {16127#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:40,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {16127#(= main_~lk6~0 1)} [171] L79-1-->L84-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[] {16127#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:40,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {16127#(= main_~lk6~0 1)} [175] L84-1-->L89-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[] {16127#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:40,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {16127#(= main_~lk6~0 1)} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {16127#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:40,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {16127#(= main_~lk6~0 1)} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {16127#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:40,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {16127#(= main_~lk6~0 1)} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {16123#false} is VALID [2022-04-08 02:56:40,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {16123#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16123#false} is VALID [2022-04-08 02:56:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:40,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774708796] [2022-04-08 02:56:40,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774708796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:40,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:40,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:40,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808805535] [2022-04-08 02:56:40,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:40,960 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-08 02:56:40,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:40,960 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-08 02:56:40,971 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-08 02:56:40,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:40,972 INFO L87 Difference]: Start difference. First operand 601 states and 727 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:41,077 INFO L93 Difference]: Finished difference Result 971 states and 1160 transitions. [2022-04-08 02:56:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:41,077 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-08 02:56:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:41,078 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-08 02:56:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-08 02:56:41,078 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-08 02:56:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-08 02:56:41,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-08 02:56:41,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:41,143 INFO L225 Difference]: With dead ends: 971 [2022-04-08 02:56:41,143 INFO L226 Difference]: Without dead ends: 969 [2022-04-08 02:56:41,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:41,144 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:41,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-08 02:56:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-08 02:56:41,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:41,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,159 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,160 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:41,189 INFO L93 Difference]: Finished difference Result 969 states and 1127 transitions. [2022-04-08 02:56:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1127 transitions. [2022-04-08 02:56:41,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:41,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:41,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 2 states have call successors, (2), 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 969 states. [2022-04-08 02:56:41,203 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 2 states have call successors, (2), 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 969 states. [2022-04-08 02:56:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:41,236 INFO L93 Difference]: Finished difference Result 969 states and 1127 transitions. [2022-04-08 02:56:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1127 transitions. [2022-04-08 02:56:41,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:41,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:41,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:41,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1063 transitions. [2022-04-08 02:56:41,274 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1063 transitions. Word has length 22 [2022-04-08 02:56:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:41,274 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1063 transitions. [2022-04-08 02:56:41,275 INFO L479 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-08 02:56:41,275 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1063 transitions. [2022-04-08 02:56:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:56:41,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:41,276 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:41,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 02:56:41,276 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash -209012234, now seen corresponding path program 1 times [2022-04-08 02:56:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:41,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430196168] [2022-04-08 02:56:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:41,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {20063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {20057#true} is VALID [2022-04-08 02:56:41,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {20057#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20057#true} is VALID [2022-04-08 02:56:41,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20057#true} {20057#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20057#true} is VALID [2022-04-08 02:56:41,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {20057#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:41,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {20063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] 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] {20057#true} is VALID [2022-04-08 02:56:41,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {20057#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20057#true} is VALID [2022-04-08 02:56:41,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20057#true} {20057#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20057#true} is VALID [2022-04-08 02:56:41,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {20057#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20057#true} is VALID [2022-04-08 02:56:41,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {20057#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {20057#true} is VALID [2022-04-08 02:56:41,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {20057#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {20057#true} is VALID [2022-04-08 02:56:41,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {20057#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 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_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~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] {20057#true} is VALID [2022-04-08 02:56:41,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {20057#true} [149] L48-->L48-2: Formula: (= 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[] {20057#true} is VALID [2022-04-08 02:56:41,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {20057#true} [151] L48-2-->L52-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[] {20057#true} is VALID [2022-04-08 02:56:41,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {20057#true} [153] L52-1-->L56-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[] {20057#true} is VALID [2022-04-08 02:56:41,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {20057#true} [155] L56-1-->L60-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[] {20057#true} is VALID [2022-04-08 02:56:41,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {20057#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {20057#true} is VALID [2022-04-08 02:56:41,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {20057#true} [159] L64-1-->L68-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {20062#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:41,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {20062#(= main_~p6~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {20062#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:41,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {20062#(= main_~p6~0 0)} [165] L74-1-->L79-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[] {20062#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:41,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {20062#(= main_~p6~0 0)} [171] L79-1-->L84-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[] {20062#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:41,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {20062#(= main_~p6~0 0)} [175] L84-1-->L89-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[] {20062#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:41,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {20062#(= main_~p6~0 0)} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {20062#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:41,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {20062#(= main_~p6~0 0)} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {20058#false} is VALID [2022-04-08 02:56:41,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {20058#false} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {20058#false} is VALID [2022-04-08 02:56:41,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {20058#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20058#false} is VALID [2022-04-08 02:56:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:41,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:41,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430196168] [2022-04-08 02:56:41,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430196168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:41,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:41,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:41,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416228184] [2022-04-08 02:56:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:41,333 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-08 02:56:41,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:41,334 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-08 02:56:41,344 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-08 02:56:41,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:41,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:41,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:41,345 INFO L87 Difference]: Start difference. First operand 905 states and 1063 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-08 02:56:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:41,560 INFO L93 Difference]: Finished difference Result 1993 states and 2279 transitions. [2022-04-08 02:56:41,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:41,561 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-08 02:56:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:41,561 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-08 02:56:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 02:56:41,562 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-08 02:56:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 02:56:41,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 02:56:41,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:41,617 INFO L225 Difference]: With dead ends: 1993 [2022-04-08 02:56:41,617 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 02:56:41,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:41,620 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:41,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 02:56:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 02:56:41,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:41,620 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-08 02:56:41,620 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-08 02:56:41,621 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-08 02:56:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:41,621 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:56:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:56:41,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:41,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:41,621 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-08 02:56:41,621 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-08 02:56:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:41,621 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:56:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:56:41,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:41,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:41,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:41,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:41,621 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-08 02:56:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 02:56:41,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-08 02:56:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:41,622 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 02:56:41,622 INFO L479 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-08 02:56:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:56:41,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:41,624 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 02:56:41,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 02:56:41,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 02:56:42,467 INFO L878 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-08 02:56:42,467 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:56:42,467 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:56:42,467 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 02:56:42,467 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 02:56:42,467 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:56:42,467 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:56:42,467 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-04-08 02:56:42,467 INFO L885 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-04-08 02:56:42,468 INFO L885 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 6 109) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L48(lines 48 50) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 6 109) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L48-2(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L52-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L56-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L60-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L64-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L68-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L74-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L878 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L79-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2022-04-08 02:56:42,468 INFO L882 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-08 02:56:42,469 INFO L882 garLoopResultBuilder]: For program point L84-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,469 INFO L882 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2022-04-08 02:56:42,469 INFO L882 garLoopResultBuilder]: For program point L89-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,469 INFO L882 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-04-08 02:56:42,469 INFO L882 garLoopResultBuilder]: For program point L94-1(lines 29 104) no Hoare annotation was computed. [2022-04-08 02:56:42,469 INFO L882 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-04-08 02:56:42,471 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:42,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 02:56:42,476 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:56:42,476 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:56:42,476 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-08 02:56:42,476 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 02:56:42,476 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:56:42,476 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-08 02:56:42,476 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2022-04-08 02:56:42,477 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-04-08 02:56:42,478 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-04-08 02:56:42,478 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-08 02:56:42,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:56:42 BasicIcfg [2022-04-08 02:56:42,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 02:56:42,484 INFO L158 Benchmark]: Toolchain (without parser) took 6578.98ms. Allocated memory was 188.7MB in the beginning and 326.1MB in the end (delta: 137.4MB). Free memory was 137.8MB in the beginning and 224.5MB in the end (delta: -86.7MB). Peak memory consumption was 165.3MB. Max. memory is 8.0GB. [2022-04-08 02:56:42,484 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory was 154.0MB in the beginning and 153.8MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:56:42,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.38ms. Allocated memory is still 188.7MB. Free memory was 137.7MB in the beginning and 164.0MB in the end (delta: -26.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 02:56:42,484 INFO L158 Benchmark]: Boogie Preprocessor took 41.32ms. Allocated memory is still 188.7MB. Free memory was 164.0MB in the beginning and 162.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:56:42,485 INFO L158 Benchmark]: RCFGBuilder took 313.86ms. Allocated memory is still 188.7MB. Free memory was 162.4MB in the beginning and 150.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 02:56:42,485 INFO L158 Benchmark]: IcfgTransformer took 33.46ms. Allocated memory is still 188.7MB. Free memory was 150.3MB in the beginning and 148.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 02:56:42,485 INFO L158 Benchmark]: TraceAbstraction took 5941.97ms. Allocated memory was 188.7MB in the beginning and 326.1MB in the end (delta: 137.4MB). Free memory was 147.8MB in the beginning and 224.5MB in the end (delta: -76.7MB). Peak memory consumption was 175.3MB. Max. memory is 8.0GB. [2022-04-08 02:56:42,495 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 188.7MB. Free memory was 154.0MB in the beginning and 153.8MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.38ms. Allocated memory is still 188.7MB. Free memory was 137.7MB in the beginning and 164.0MB in the end (delta: -26.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.32ms. Allocated memory is still 188.7MB. Free memory was 164.0MB in the beginning and 162.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.86ms. Allocated memory is still 188.7MB. Free memory was 162.4MB in the beginning and 150.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 33.46ms. Allocated memory is still 188.7MB. Free memory was 150.3MB in the beginning and 148.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5941.97ms. Allocated memory was 188.7MB in the beginning and 326.1MB in the end (delta: 137.4MB). Free memory was 147.8MB in the beginning and 224.5MB in the end (delta: -76.7MB). Peak memory consumption was 175.3MB. 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: 107]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1320 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1320 mSDsluCounter, 1061 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 653 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 940 mSDtfsCounter, 653 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=16, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 02:56:42,520 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...