/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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:01:01,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:01:01,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:01:01,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:01:01,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:01:01,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:01:01,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:01:01,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:01:01,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:01:01,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:01:01,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:01:01,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:01:01,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:01:01,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:01:01,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:01:01,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:01:01,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:01:01,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:01:01,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:01:01,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:01:01,111 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:01:01,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:01:01,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:01:01,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:01:01,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:01:01,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:01:01,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:01:01,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:01:01,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:01:01,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:01:01,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:01:01,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:01:01,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:01:01,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:01:01,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:01:01,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:01:01,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:01:01,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:01:01,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:01:01,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:01:01,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:01:01,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:01:01,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 02:01:01,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:01:01,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:01:01,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 02:01:01,137 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 02:01:01,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 02:01:01,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 02:01:01,137 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 02:01:01,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:01:01,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:01:01,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:01:01,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:01:01,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:01:01,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:01:01,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:01:01,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:01:01,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:01:01,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:01:01,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:01:01,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:01:01,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:01:01,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:01:01,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 02:01:01,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 02:01:01,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 02:01:01,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 02:01:01,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:01:01,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 02:01:01,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 02:01:01,140 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 02:01:01,140 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:01:01,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:01:01,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:01:01,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:01:01,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:01:01,492 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:01:01,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2022-04-28 02:01:01,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81445c5f8/b1fd262fe9944942b9abb3f61481a641/FLAG995d1dde8 [2022-04-28 02:01:01,908 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:01:01,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-28 02:01:01,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81445c5f8/b1fd262fe9944942b9abb3f61481a641/FLAG995d1dde8 [2022-04-28 02:01:01,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81445c5f8/b1fd262fe9944942b9abb3f61481a641 [2022-04-28 02:01:01,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:01:01,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 02:01:01,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:01:01,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:01:01,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:01:01,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:01:01" (1/1) ... [2022-04-28 02:01:01,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a05948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:01, skipping insertion in model container [2022-04-28 02:01:01,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:01:01" (1/1) ... [2022-04-28 02:01:01,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:01:01,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:01:02,135 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_10.c[3901,3914] [2022-04-28 02:01:02,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:01:02,147 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:01:02,176 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_10.c[3901,3914] [2022-04-28 02:01:02,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:01:02,188 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:01:02,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02 WrapperNode [2022-04-28 02:01:02,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:01:02,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:01:02,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:01:02,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:01:02,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:01:02,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:01:02,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:01:02,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:01:02,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:01:02,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:01:02,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:01:02,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:01:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:01:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:01:02,300 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:01:02,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:01:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:01:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:01:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:01:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:01:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:01:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:01:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:01:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:01:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:01:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:01:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:01:02,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:01:02,381 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:01:02,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:01:02,598 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:01:02,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:01:02,604 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:01:02,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:01:02 BoogieIcfgContainer [2022-04-28 02:01:02,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:01:02,605 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 02:01:02,606 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 02:01:02,606 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 02:01:02,608 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:01:02" (1/1) ... [2022-04-28 02:01:02,610 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 02:01:02,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:01:02 BasicIcfg [2022-04-28 02:01:02,639 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 02:01:02,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:01:02,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:01:02,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:01:02,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:01:01" (1/4) ... [2022-04-28 02:01:02,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9c576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:01:02, skipping insertion in model container [2022-04-28 02:01:02,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:01:02" (2/4) ... [2022-04-28 02:01:02,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9c576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:01:02, skipping insertion in model container [2022-04-28 02:01:02,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:01:02" (3/4) ... [2022-04-28 02:01:02,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9c576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:01:02, skipping insertion in model container [2022-04-28 02:01:02,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:01:02" (4/4) ... [2022-04-28 02:01:02,644 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.cqvasr [2022-04-28 02:01:02,653 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:01:02,653 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:01:02,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:01:02,685 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34eb3284, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d25f84b [2022-04-28 02:01:02,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:01:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:01:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:01:02,695 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:02,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:02,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash -666508425, now seen corresponding path program 1 times [2022-04-28 02:01:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:02,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331735162] [2022-04-28 02:01:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:02,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:02,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {48#true} is VALID [2022-04-28 02:01:02,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-28 02:01:02,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-28 02:01:02,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {48#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:02,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {48#true} is VALID [2022-04-28 02:01:02,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-28 02:01:02,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-28 02:01:02,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-28 02:01:02,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {48#true} is VALID [2022-04-28 02:01:02,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {48#true} is VALID [2022-04-28 02:01:02,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {48#true} is VALID [2022-04-28 02:01:02,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#true} [216] L68-->L68-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= main_~lk1~0 1)} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(= main_~lk1~0 1)} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#(= main_~lk1~0 1)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(= main_~lk1~0 1)} [224] L80-1-->L84-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] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {53#(= main_~lk1~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {53#(= main_~lk1~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {53#(= main_~lk1~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {53#(= main_~lk1~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {53#(= main_~lk1~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {53#(= main_~lk1~0 1)} [236] L104-1-->L111: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {53#(= main_~lk1~0 1)} is VALID [2022-04-28 02:01:02,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} [238] L111-->L156-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {49#false} is VALID [2022-04-28 02:01:02,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49#false} is VALID [2022-04-28 02:01:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:02,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:02,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331735162] [2022-04-28 02:01:02,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331735162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:02,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:02,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636638273] [2022-04-28 02:01:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:01:02,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:02,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:02,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:02,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:02,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:02,963 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:03,240 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-04-28 02:01:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:03,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:01:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 02:01:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 02:01:03,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 02:01:03,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:03,390 INFO L225 Difference]: With dead ends: 88 [2022-04-28 02:01:03,390 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 02:01:03,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:03,396 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:03,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:01:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 02:01:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-28 02:01:03,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:03,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,434 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,435 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:03,441 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-28 02:01:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-28 02:01:03,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:03,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:03,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 02:01:03,445 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 02:01:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:03,450 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-28 02:01:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-28 02:01:03,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:03,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:03,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:03,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-28 02:01:03,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-28 02:01:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:03,466 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-28 02:01:03,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-28 02:01:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:01:03,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:03,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:03,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:01:03,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:03,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash -959911432, now seen corresponding path program 1 times [2022-04-28 02:01:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:03,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194803700] [2022-04-28 02:01:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:03,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {363#true} is VALID [2022-04-28 02:01:03,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-28 02:01:03,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-28 02:01:03,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:03,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {363#true} is VALID [2022-04-28 02:01:03,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-28 02:01:03,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-28 02:01:03,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-28 02:01:03,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {363#true} is VALID [2022-04-28 02:01:03,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {363#true} is VALID [2022-04-28 02:01:03,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {363#true} is VALID [2022-04-28 02:01:03,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(= main_~p1~0 0)} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(= main_~p1~0 0)} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(= main_~p1~0 0)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(= main_~p1~0 0)} [224] L80-1-->L84-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] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#(= main_~p1~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#(= main_~p1~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#(= main_~p1~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {368#(= main_~p1~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {368#(= main_~p1~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {368#(= main_~p1~0 0)} is VALID [2022-04-28 02:01:03,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {368#(= main_~p1~0 0)} [236] L104-1-->L111: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-28 02:01:03,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#false} [238] L111-->L156-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-28 02:01:03,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-28 02:01:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194803700] [2022-04-28 02:01:03,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194803700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:03,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:03,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337399341] [2022-04-28 02:01:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:03,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:01:03,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:03,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:03,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:03,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:03,606 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:03,785 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-04-28 02:01:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:03,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:01:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-28 02:01:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-28 02:01:03,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-28 02:01:03,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:03,917 INFO L225 Difference]: With dead ends: 118 [2022-04-28 02:01:03,917 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 02:01:03,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:03,919 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:03,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 02:01:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-28 02:01:03,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:03,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,924 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,924 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:03,926 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-28 02:01:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-28 02:01:03,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:03,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:03,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 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 73 states. [2022-04-28 02:01:03,927 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 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 73 states. [2022-04-28 02:01:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:03,930 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-28 02:01:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-28 02:01:03,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:03,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:03,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:03,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-28 02:01:03,932 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-28 02:01:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:03,933 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-28 02:01:03,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-28 02:01:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:01:03,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:03,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:03,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:01:03,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 813107322, now seen corresponding path program 1 times [2022-04-28 02:01:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:03,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81734053] [2022-04-28 02:01:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:03,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:04,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {727#true} is VALID [2022-04-28 02:01:04,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {727#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-28 02:01:04,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {727#true} {727#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-28 02:01:04,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {727#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:04,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {727#true} is VALID [2022-04-28 02:01:04,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {727#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-28 02:01:04,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {727#true} {727#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-28 02:01:04,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {727#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-28 02:01:04,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {727#true} is VALID [2022-04-28 02:01:04,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {727#true} is VALID [2022-04-28 02:01:04,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {727#true} is VALID [2022-04-28 02:01:04,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {727#true} [216] L68-->L68-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {732#(not (= main_~p1~0 0))} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {732#(not (= main_~p1~0 0))} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {732#(not (= main_~p1~0 0))} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {732#(not (= main_~p1~0 0))} [224] L80-1-->L84-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] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {732#(not (= main_~p1~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {732#(not (= main_~p1~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {732#(not (= main_~p1~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {732#(not (= main_~p1~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {732#(not (= main_~p1~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:01:04,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {732#(not (= main_~p1~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {728#false} is VALID [2022-04-28 02:01:04,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {728#false} [240] L110-1-->L116: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {728#false} is VALID [2022-04-28 02:01:04,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {728#false} [244] L116-->L156-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {728#false} is VALID [2022-04-28 02:01:04,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {728#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#false} is VALID [2022-04-28 02:01:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:04,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:04,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81734053] [2022-04-28 02:01:04,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81734053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:04,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:04,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139792177] [2022-04-28 02:01:04,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:04,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:01:04,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:04,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:04,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:04,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:04,046 INFO L87 Difference]: Start difference. First operand 71 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,210 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-04-28 02:01:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:04,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:01:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 02:01:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 02:01:04,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-28 02:01:04,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:04,335 INFO L225 Difference]: With dead ends: 109 [2022-04-28 02:01:04,335 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 02:01:04,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:04,336 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:04,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 02:01:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-28 02:01:04,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:04,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,342 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,342 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,344 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-28 02:01:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-28 02:01:04,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:04,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:04,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 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 76 states. [2022-04-28 02:01:04,345 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 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 76 states. [2022-04-28 02:01:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,347 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-28 02:01:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-28 02:01:04,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:04,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:04,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:04,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-28 02:01:04,349 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-28 02:01:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:04,350 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-28 02:01:04,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-28 02:01:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:01:04,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:04,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:04,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:01:04,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 307548697, now seen corresponding path program 1 times [2022-04-28 02:01:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:04,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958561435] [2022-04-28 02:01:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:04,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {1093#true} is VALID [2022-04-28 02:01:04,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-28 02:01:04,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1093#true} {1093#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-28 02:01:04,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:04,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {1093#true} is VALID [2022-04-28 02:01:04,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-28 02:01:04,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-28 02:01:04,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-28 02:01:04,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1093#true} is VALID [2022-04-28 02:01:04,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {1093#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {1093#true} is VALID [2022-04-28 02:01:04,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {1093#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1093#true} is VALID [2022-04-28 02:01:04,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {1093#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-28 02:01:04,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {1093#true} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(= main_~lk2~0 1)} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(= main_~lk2~0 1)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {1098#(= main_~lk2~0 1)} [224] L80-1-->L84-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] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {1098#(= main_~lk2~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {1098#(= main_~lk2~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#(= main_~lk2~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {1098#(= main_~lk2~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {1098#(= main_~lk2~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {1098#(= main_~lk2~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {1098#(= main_~lk2~0 1)} [240] L110-1-->L116: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1098#(= main_~lk2~0 1)} is VALID [2022-04-28 02:01:04,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {1098#(= main_~lk2~0 1)} [244] L116-->L156-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-28 02:01:04,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-28 02:01:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:04,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958561435] [2022-04-28 02:01:04,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958561435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:04,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:04,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691023206] [2022-04-28 02:01:04,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:04,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:01:04,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:04,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:04,422 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,555 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2022-04-28 02:01:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:04,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:01:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 02:01:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 02:01:04,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 02:01:04,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:04,637 INFO L225 Difference]: With dead ends: 137 [2022-04-28 02:01:04,637 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 02:01:04,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:04,638 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:04,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 02:01:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-04-28 02:01:04,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:04,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,644 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,644 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,647 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2022-04-28 02:01:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 238 transitions. [2022-04-28 02:01:04,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:04,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:04,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 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 135 states. [2022-04-28 02:01:04,648 INFO L87 Difference]: Start difference. First operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 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 135 states. [2022-04-28 02:01:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,651 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2022-04-28 02:01:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 238 transitions. [2022-04-28 02:01:04,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:04,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:04,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:04,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 169 transitions. [2022-04-28 02:01:04,654 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 169 transitions. Word has length 22 [2022-04-28 02:01:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:04,654 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 169 transitions. [2022-04-28 02:01:04,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 169 transitions. [2022-04-28 02:01:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:01:04,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:04,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:04,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:01:04,655 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash 14145690, now seen corresponding path program 1 times [2022-04-28 02:01:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:04,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872303498] [2022-04-28 02:01:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:04,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {1635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {1629#true} is VALID [2022-04-28 02:01:04,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-28 02:01:04,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1629#true} {1629#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-28 02:01:04,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {1629#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:04,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {1629#true} is VALID [2022-04-28 02:01:04,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {1629#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-28 02:01:04,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1629#true} {1629#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-28 02:01:04,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {1629#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-28 02:01:04,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1629#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1629#true} is VALID [2022-04-28 02:01:04,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1629#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {1629#true} is VALID [2022-04-28 02:01:04,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1629#true} is VALID [2022-04-28 02:01:04,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-28 02:01:04,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {1629#true} [219] L68-2-->L72-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[] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {1634#(= main_~p2~0 0)} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {1634#(= main_~p2~0 0)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {1634#(= main_~p2~0 0)} [224] L80-1-->L84-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] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {1634#(= main_~p2~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {1634#(= main_~p2~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {1634#(= main_~p2~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {1634#(= main_~p2~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {1634#(= main_~p2~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {1634#(= main_~p2~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1634#(= main_~p2~0 0)} is VALID [2022-04-28 02:01:04,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(= main_~p2~0 0)} [240] L110-1-->L116: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1630#false} is VALID [2022-04-28 02:01:04,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {1630#false} [244] L116-->L156-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1630#false} is VALID [2022-04-28 02:01:04,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#false} is VALID [2022-04-28 02:01:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:04,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:04,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872303498] [2022-04-28 02:01:04,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872303498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:04,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:04,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:04,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726758128] [2022-04-28 02:01:04,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:04,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:01:04,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:04,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:04,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:04,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:04,708 INFO L87 Difference]: Start difference. First operand 97 states and 169 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,835 INFO L93 Difference]: Finished difference Result 225 states and 399 transitions. [2022-04-28 02:01:04,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:04,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:01:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-28 02:01:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-28 02:01:04,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-28 02:01:04,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:04,944 INFO L225 Difference]: With dead ends: 225 [2022-04-28 02:01:04,944 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 02:01:04,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:04,946 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:04,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 97 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 02:01:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-28 02:01:04,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:04,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,951 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,951 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,954 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2022-04-28 02:01:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 236 transitions. [2022-04-28 02:01:04,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:04,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:04,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 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 137 states. [2022-04-28 02:01:04,955 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 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 137 states. [2022-04-28 02:01:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:04,958 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2022-04-28 02:01:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 236 transitions. [2022-04-28 02:01:04,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:04,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:04,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:04,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-28 02:01:04,962 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-28 02:01:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:04,962 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-28 02:01:04,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-28 02:01:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:01:04,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:04,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:04,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:01:04,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:04,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:04,963 INFO L85 PathProgramCache]: Analyzing trace with hash 944107156, now seen corresponding path program 1 times [2022-04-28 02:01:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428612625] [2022-04-28 02:01:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:04,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {2305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {2299#true} is VALID [2022-04-28 02:01:04,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {2299#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-28 02:01:04,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2299#true} {2299#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-28 02:01:04,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {2299#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:04,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {2305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {2299#true} is VALID [2022-04-28 02:01:04,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {2299#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-28 02:01:04,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2299#true} {2299#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-28 02:01:04,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {2299#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-28 02:01:04,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {2299#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2299#true} is VALID [2022-04-28 02:01:04,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {2299#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {2299#true} is VALID [2022-04-28 02:01:04,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {2299#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2299#true} is VALID [2022-04-28 02:01:04,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {2299#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-28 02:01:04,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {2299#true} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:04,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {2304#(not (= main_~p2~0 0))} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:04,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {2304#(not (= main_~p2~0 0))} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:04,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {2304#(not (= main_~p2~0 0))} [224] L80-1-->L84-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] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:05,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {2304#(not (= main_~p2~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:05,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {2304#(not (= main_~p2~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:05,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {2304#(not (= main_~p2~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:05,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {2304#(not (= main_~p2~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:05,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {2304#(not (= main_~p2~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:05,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {2304#(not (= main_~p2~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:01:05,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {2304#(not (= main_~p2~0 0))} [241] L110-1-->L115-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[] {2300#false} is VALID [2022-04-28 02:01:05,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {2300#false} [246] L115-1-->L121: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2300#false} is VALID [2022-04-28 02:01:05,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {2300#false} [248] L121-->L156-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2300#false} is VALID [2022-04-28 02:01:05,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {2300#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#false} is VALID [2022-04-28 02:01:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:05,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:05,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428612625] [2022-04-28 02:01:05,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428612625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:05,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:05,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560870169] [2022-04-28 02:01:05,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:05,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:01:05,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:05,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:05,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:05,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:05,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:05,016 INFO L87 Difference]: Start difference. First operand 135 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,142 INFO L93 Difference]: Finished difference Result 202 states and 350 transitions. [2022-04-28 02:01:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:05,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:01:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 02:01:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 02:01:05,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-28 02:01:05,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:05,252 INFO L225 Difference]: With dead ends: 202 [2022-04-28 02:01:05,252 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 02:01:05,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:05,253 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:05,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 110 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 02:01:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-04-28 02:01:05,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:05,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,258 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,258 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,261 INFO L93 Difference]: Finished difference Result 139 states and 236 transitions. [2022-04-28 02:01:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 236 transitions. [2022-04-28 02:01:05,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:05,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:05,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 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 139 states. [2022-04-28 02:01:05,262 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 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 139 states. [2022-04-28 02:01:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,265 INFO L93 Difference]: Finished difference Result 139 states and 236 transitions. [2022-04-28 02:01:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 236 transitions. [2022-04-28 02:01:05,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:05,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:05,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:05,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 235 transitions. [2022-04-28 02:01:05,269 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 235 transitions. Word has length 23 [2022-04-28 02:01:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:05,269 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 235 transitions. [2022-04-28 02:01:05,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 235 transitions. [2022-04-28 02:01:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:01:05,269 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:05,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:05,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:01:05,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash 438548531, now seen corresponding path program 1 times [2022-04-28 02:01:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:05,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665938583] [2022-04-28 02:01:05,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:05,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:05,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {2958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {2952#true} is VALID [2022-04-28 02:01:05,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-28 02:01:05,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2952#true} {2952#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-28 02:01:05,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:05,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {2958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {2952#true} is VALID [2022-04-28 02:01:05,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-28 02:01:05,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-28 02:01:05,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-28 02:01:05,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2952#true} is VALID [2022-04-28 02:01:05,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {2952#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {2952#true} is VALID [2022-04-28 02:01:05,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2952#true} is VALID [2022-04-28 02:01:05,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-28 02:01:05,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} [219] L68-2-->L72-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[] {2952#true} is VALID [2022-04-28 02:01:05,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {2952#true} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {2957#(= main_~lk3~0 1)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {2957#(= main_~lk3~0 1)} [224] L80-1-->L84-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] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {2957#(= main_~lk3~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {2957#(= main_~lk3~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {2957#(= main_~lk3~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {2957#(= main_~lk3~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {2957#(= main_~lk3~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {2957#(= main_~lk3~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {2957#(= main_~lk3~0 1)} [241] L110-1-->L115-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[] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {2957#(= main_~lk3~0 1)} [246] L115-1-->L121: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2957#(= main_~lk3~0 1)} is VALID [2022-04-28 02:01:05,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {2957#(= main_~lk3~0 1)} [248] L121-->L156-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2953#false} is VALID [2022-04-28 02:01:05,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {2953#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2953#false} is VALID [2022-04-28 02:01:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:05,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665938583] [2022-04-28 02:01:05,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665938583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:05,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:05,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:05,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075687494] [2022-04-28 02:01:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:05,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:01:05,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:05,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:05,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:05,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:05,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:05,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:05,331 INFO L87 Difference]: Start difference. First operand 137 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,468 INFO L93 Difference]: Finished difference Result 253 states and 441 transitions. [2022-04-28 02:01:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:05,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:01:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 02:01:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 02:01:05,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-28 02:01:05,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:05,547 INFO L225 Difference]: With dead ends: 253 [2022-04-28 02:01:05,547 INFO L226 Difference]: Without dead ends: 251 [2022-04-28 02:01:05,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:05,548 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:05,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-28 02:01:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 185. [2022-04-28 02:01:05,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:05,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,554 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,554 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,559 INFO L93 Difference]: Finished difference Result 251 states and 436 transitions. [2022-04-28 02:01:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 436 transitions. [2022-04-28 02:01:05,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:05,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:05,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 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 251 states. [2022-04-28 02:01:05,560 INFO L87 Difference]: Start difference. First operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 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 251 states. [2022-04-28 02:01:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,565 INFO L93 Difference]: Finished difference Result 251 states and 436 transitions. [2022-04-28 02:01:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 436 transitions. [2022-04-28 02:01:05,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:05,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:05,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:05,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 315 transitions. [2022-04-28 02:01:05,570 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 315 transitions. Word has length 23 [2022-04-28 02:01:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:05,570 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 315 transitions. [2022-04-28 02:01:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 315 transitions. [2022-04-28 02:01:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:01:05,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:05,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:05,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 02:01:05,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash 145145524, now seen corresponding path program 1 times [2022-04-28 02:01:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:05,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198367208] [2022-04-28 02:01:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:05,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {3936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {3930#true} is VALID [2022-04-28 02:01:05,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3930#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-28 02:01:05,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3930#true} {3930#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-28 02:01:05,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {3930#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:05,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {3936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {3930#true} is VALID [2022-04-28 02:01:05,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {3930#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-28 02:01:05,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3930#true} {3930#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-28 02:01:05,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {3930#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-28 02:01:05,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {3930#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3930#true} is VALID [2022-04-28 02:01:05,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {3930#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {3930#true} is VALID [2022-04-28 02:01:05,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {3930#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {3930#true} is VALID [2022-04-28 02:01:05,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {3930#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-28 02:01:05,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {3930#true} [219] L68-2-->L72-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[] {3930#true} is VALID [2022-04-28 02:01:05,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {3930#true} [221] L72-1-->L76-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[] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {3935#(= main_~p3~0 0)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {3935#(= main_~p3~0 0)} [224] L80-1-->L84-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] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {3935#(= main_~p3~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {3935#(= main_~p3~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {3935#(= main_~p3~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {3935#(= main_~p3~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {3935#(= main_~p3~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {3935#(= main_~p3~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {3935#(= main_~p3~0 0)} [241] L110-1-->L115-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[] {3935#(= main_~p3~0 0)} is VALID [2022-04-28 02:01:05,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {3935#(= main_~p3~0 0)} [246] L115-1-->L121: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {3931#false} is VALID [2022-04-28 02:01:05,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {3931#false} [248] L121-->L156-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {3931#false} is VALID [2022-04-28 02:01:05,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {3931#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3931#false} is VALID [2022-04-28 02:01:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:05,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:05,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198367208] [2022-04-28 02:01:05,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198367208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:05,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:05,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087947925] [2022-04-28 02:01:05,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:01:05,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:05,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:05,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:05,616 INFO L87 Difference]: Start difference. First operand 185 states and 315 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,747 INFO L93 Difference]: Finished difference Result 433 states and 745 transitions. [2022-04-28 02:01:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:01:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-28 02:01:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-28 02:01:05,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-28 02:01:05,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:05,857 INFO L225 Difference]: With dead ends: 433 [2022-04-28 02:01:05,857 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 02:01:05,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:05,858 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:05,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 02:01:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-28 02:01:05,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:05,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,864 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,865 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,869 INFO L93 Difference]: Finished difference Result 259 states and 436 transitions. [2022-04-28 02:01:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2022-04-28 02:01:05,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:05,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:05,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 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 259 states. [2022-04-28 02:01:05,870 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 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 259 states. [2022-04-28 02:01:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:05,874 INFO L93 Difference]: Finished difference Result 259 states and 436 transitions. [2022-04-28 02:01:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2022-04-28 02:01:05,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:05,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:05,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:05,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 435 transitions. [2022-04-28 02:01:05,879 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 435 transitions. Word has length 23 [2022-04-28 02:01:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:05,879 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 435 transitions. [2022-04-28 02:01:05,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 435 transitions. [2022-04-28 02:01:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:01:05,879 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:05,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 02:01:05,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 710134838, now seen corresponding path program 1 times [2022-04-28 02:01:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:05,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694702159] [2022-04-28 02:01:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:05,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:05,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {5190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {5184#true} is VALID [2022-04-28 02:01:05,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {5184#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-28 02:01:05,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5184#true} {5184#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-28 02:01:05,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {5184#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:05,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {5190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {5184#true} is VALID [2022-04-28 02:01:05,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {5184#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-28 02:01:05,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5184#true} {5184#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-28 02:01:05,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {5184#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-28 02:01:05,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {5184#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5184#true} is VALID [2022-04-28 02:01:05,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {5184#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {5184#true} is VALID [2022-04-28 02:01:05,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {5184#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {5184#true} is VALID [2022-04-28 02:01:05,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {5184#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-28 02:01:05,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {5184#true} [219] L68-2-->L72-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[] {5184#true} is VALID [2022-04-28 02:01:05,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {5184#true} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {5189#(not (= main_~p3~0 0))} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {5189#(not (= main_~p3~0 0))} [224] L80-1-->L84-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] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {5189#(not (= main_~p3~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {5189#(not (= main_~p3~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {5189#(not (= main_~p3~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {5189#(not (= main_~p3~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {5189#(not (= main_~p3~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {5189#(not (= main_~p3~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {5189#(not (= main_~p3~0 0))} [241] L110-1-->L115-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[] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:01:05,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {5189#(not (= main_~p3~0 0))} [247] L115-1-->L120-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[] {5185#false} is VALID [2022-04-28 02:01:05,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {5185#false} [250] L120-1-->L126: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {5185#false} is VALID [2022-04-28 02:01:05,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {5185#false} [252] L126-->L156-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {5185#false} is VALID [2022-04-28 02:01:05,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {5185#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5185#false} is VALID [2022-04-28 02:01:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:05,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694702159] [2022-04-28 02:01:05,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694702159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:05,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:05,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164530189] [2022-04-28 02:01:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:05,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:01:05,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:05,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:05,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:05,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:05,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:05,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:05,924 INFO L87 Difference]: Start difference. First operand 257 states and 435 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,050 INFO L93 Difference]: Finished difference Result 385 states and 649 transitions. [2022-04-28 02:01:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:06,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:01:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-28 02:01:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-28 02:01:06,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-28 02:01:06,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:06,159 INFO L225 Difference]: With dead ends: 385 [2022-04-28 02:01:06,159 INFO L226 Difference]: Without dead ends: 263 [2022-04-28 02:01:06,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:06,160 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:06,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-28 02:01:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-28 02:01:06,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:06,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,165 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,166 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,170 INFO L93 Difference]: Finished difference Result 263 states and 436 transitions. [2022-04-28 02:01:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 436 transitions. [2022-04-28 02:01:06,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:06,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:06,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 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 263 states. [2022-04-28 02:01:06,171 INFO L87 Difference]: Start difference. First operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 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 263 states. [2022-04-28 02:01:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,174 INFO L93 Difference]: Finished difference Result 263 states and 436 transitions. [2022-04-28 02:01:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 436 transitions. [2022-04-28 02:01:06,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:06,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:06,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:06,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2022-04-28 02:01:06,179 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 24 [2022-04-28 02:01:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:06,179 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2022-04-28 02:01:06,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2022-04-28 02:01:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:01:06,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:06,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:06,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 02:01:06,180 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash 204576213, now seen corresponding path program 1 times [2022-04-28 02:01:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:06,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487641518] [2022-04-28 02:01:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:06,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:06,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {6408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {6402#true} is VALID [2022-04-28 02:01:06,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {6402#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-28 02:01:06,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6402#true} {6402#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-28 02:01:06,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {6402#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:06,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {6408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {6402#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6402#true} {6402#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {6402#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {6402#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {6402#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {6402#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {6402#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {6402#true} [219] L68-2-->L72-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[] {6402#true} is VALID [2022-04-28 02:01:06,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {6402#true} [221] L72-1-->L76-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[] {6402#true} is VALID [2022-04-28 02:01:06,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {6402#true} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {6407#(= main_~lk4~0 1)} [224] L80-1-->L84-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] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {6407#(= main_~lk4~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {6407#(= main_~lk4~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {6407#(= main_~lk4~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {6407#(= main_~lk4~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {6407#(= main_~lk4~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {6407#(= main_~lk4~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {6407#(= main_~lk4~0 1)} [241] L110-1-->L115-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[] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {6407#(= main_~lk4~0 1)} [247] L115-1-->L120-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[] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {6407#(= main_~lk4~0 1)} [250] L120-1-->L126: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {6407#(= main_~lk4~0 1)} is VALID [2022-04-28 02:01:06,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {6407#(= main_~lk4~0 1)} [252] L126-->L156-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {6403#false} is VALID [2022-04-28 02:01:06,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {6403#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6403#false} is VALID [2022-04-28 02:01:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:06,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:06,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487641518] [2022-04-28 02:01:06,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487641518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:06,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:06,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:06,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998879341] [2022-04-28 02:01:06,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:06,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:01:06,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:06,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:06,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:06,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:06,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:06,278 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,390 INFO L93 Difference]: Finished difference Result 477 states and 809 transitions. [2022-04-28 02:01:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:01:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-28 02:01:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-28 02:01:06,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-28 02:01:06,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:06,451 INFO L225 Difference]: With dead ends: 477 [2022-04-28 02:01:06,451 INFO L226 Difference]: Without dead ends: 475 [2022-04-28 02:01:06,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:06,452 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:06,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-28 02:01:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-28 02:01:06,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:06,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,460 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,462 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,470 INFO L93 Difference]: Finished difference Result 475 states and 800 transitions. [2022-04-28 02:01:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 800 transitions. [2022-04-28 02:01:06,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:06,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:06,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 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 475 states. [2022-04-28 02:01:06,472 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 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 475 states. [2022-04-28 02:01:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,488 INFO L93 Difference]: Finished difference Result 475 states and 800 transitions. [2022-04-28 02:01:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 800 transitions. [2022-04-28 02:01:06,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:06,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:06,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:06,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 591 transitions. [2022-04-28 02:01:06,495 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 591 transitions. Word has length 24 [2022-04-28 02:01:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:06,495 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 591 transitions. [2022-04-28 02:01:06,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 591 transitions. [2022-04-28 02:01:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:01:06,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:06,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:06,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 02:01:06,496 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:06,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -88826794, now seen corresponding path program 1 times [2022-04-28 02:01:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:06,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780913570] [2022-04-28 02:01:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:06,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {8246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {8240#true} is VALID [2022-04-28 02:01:06,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {8240#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-28 02:01:06,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8240#true} {8240#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-28 02:01:06,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {8240#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:06,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {8246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {8240#true} is VALID [2022-04-28 02:01:06,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {8240#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-28 02:01:06,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8240#true} {8240#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-28 02:01:06,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {8240#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-28 02:01:06,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {8240#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8240#true} is VALID [2022-04-28 02:01:06,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {8240#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {8240#true} is VALID [2022-04-28 02:01:06,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {8240#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {8240#true} is VALID [2022-04-28 02:01:06,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {8240#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-28 02:01:06,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {8240#true} [219] L68-2-->L72-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[] {8240#true} is VALID [2022-04-28 02:01:06,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {8240#true} [221] L72-1-->L76-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[] {8240#true} is VALID [2022-04-28 02:01:06,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {8240#true} [223] L76-1-->L80-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[] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {8245#(= main_~p4~0 0)} [224] L80-1-->L84-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] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {8245#(= main_~p4~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {8245#(= main_~p4~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {8245#(= main_~p4~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {8245#(= main_~p4~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {8245#(= main_~p4~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {8245#(= main_~p4~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {8245#(= main_~p4~0 0)} [241] L110-1-->L115-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[] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {8245#(= main_~p4~0 0)} [247] L115-1-->L120-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[] {8245#(= main_~p4~0 0)} is VALID [2022-04-28 02:01:06,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {8245#(= main_~p4~0 0)} [250] L120-1-->L126: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {8241#false} is VALID [2022-04-28 02:01:06,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {8241#false} [252] L126-->L156-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {8241#false} is VALID [2022-04-28 02:01:06,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {8241#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8241#false} is VALID [2022-04-28 02:01:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:06,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:06,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780913570] [2022-04-28 02:01:06,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780913570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:06,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:06,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:06,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403009580] [2022-04-28 02:01:06,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:06,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:01:06,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:06,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:06,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:06,550 INFO L87 Difference]: Start difference. First operand 361 states and 591 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,703 INFO L93 Difference]: Finished difference Result 845 states and 1393 transitions. [2022-04-28 02:01:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:06,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:01:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-28 02:01:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-28 02:01:06,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-28 02:01:06,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:06,802 INFO L225 Difference]: With dead ends: 845 [2022-04-28 02:01:06,802 INFO L226 Difference]: Without dead ends: 499 [2022-04-28 02:01:06,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:06,804 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:06,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-28 02:01:06,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-28 02:01:06,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:06,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,812 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,812 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,823 INFO L93 Difference]: Finished difference Result 499 states and 808 transitions. [2022-04-28 02:01:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 808 transitions. [2022-04-28 02:01:06,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:06,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:06,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 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 499 states. [2022-04-28 02:01:06,825 INFO L87 Difference]: Start difference. First operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 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 499 states. [2022-04-28 02:01:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:06,835 INFO L93 Difference]: Finished difference Result 499 states and 808 transitions. [2022-04-28 02:01:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 808 transitions. [2022-04-28 02:01:06,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:06,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:06,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:06,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 807 transitions. [2022-04-28 02:01:06,856 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 807 transitions. Word has length 24 [2022-04-28 02:01:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:06,857 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 807 transitions. [2022-04-28 02:01:06,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 807 transitions. [2022-04-28 02:01:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:01:06,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:06,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:06,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 02:01:06,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2046927696, now seen corresponding path program 1 times [2022-04-28 02:01:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:06,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244292881] [2022-04-28 02:01:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:06,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {10652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {10646#true} is VALID [2022-04-28 02:01:06,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {10646#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-28 02:01:06,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10646#true} {10646#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {10646#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:06,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {10652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {10646#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10646#true} {10646#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {10646#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {10646#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {10646#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {10646#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {10646#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-28 02:01:06,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {10646#true} [219] L68-2-->L72-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[] {10646#true} is VALID [2022-04-28 02:01:06,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {10646#true} [221] L72-1-->L76-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[] {10646#true} is VALID [2022-04-28 02:01:06,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {10646#true} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {10651#(not (= main_~p4~0 0))} [224] L80-1-->L84-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] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {10651#(not (= main_~p4~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {10651#(not (= main_~p4~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {10651#(not (= main_~p4~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {10651#(not (= main_~p4~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {10651#(not (= main_~p4~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {10651#(not (= main_~p4~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {10651#(not (= main_~p4~0 0))} [241] L110-1-->L115-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[] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {10651#(not (= main_~p4~0 0))} [247] L115-1-->L120-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[] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:01:06,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {10651#(not (= main_~p4~0 0))} [251] L120-1-->L125-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[] {10647#false} is VALID [2022-04-28 02:01:06,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {10647#false} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {10647#false} is VALID [2022-04-28 02:01:06,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {10647#false} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {10647#false} is VALID [2022-04-28 02:01:06,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {10647#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10647#false} is VALID [2022-04-28 02:01:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:06,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:06,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244292881] [2022-04-28 02:01:06,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244292881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:06,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:06,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725956265] [2022-04-28 02:01:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:01:06,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:06,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:06,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:06,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:06,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:06,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:06,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:06,920 INFO L87 Difference]: Start difference. First operand 497 states and 807 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:07,061 INFO L93 Difference]: Finished difference Result 745 states and 1205 transitions. [2022-04-28 02:01:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:01:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-28 02:01:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-28 02:01:07,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-28 02:01:07,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:07,175 INFO L225 Difference]: With dead ends: 745 [2022-04-28 02:01:07,176 INFO L226 Difference]: Without dead ends: 507 [2022-04-28 02:01:07,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:07,177 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:07,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-28 02:01:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-28 02:01:07,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:07,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,185 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,186 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:07,196 INFO L93 Difference]: Finished difference Result 507 states and 808 transitions. [2022-04-28 02:01:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 808 transitions. [2022-04-28 02:01:07,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:07,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:07,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 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 507 states. [2022-04-28 02:01:07,197 INFO L87 Difference]: Start difference. First operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 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 507 states. [2022-04-28 02:01:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:07,207 INFO L93 Difference]: Finished difference Result 507 states and 808 transitions. [2022-04-28 02:01:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 808 transitions. [2022-04-28 02:01:07,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:07,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:07,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:07,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 807 transitions. [2022-04-28 02:01:07,217 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 807 transitions. Word has length 25 [2022-04-28 02:01:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:07,217 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 807 transitions. [2022-04-28 02:01:07,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 807 transitions. [2022-04-28 02:01:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:01:07,218 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:07,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:07,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 02:01:07,218 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1541369071, now seen corresponding path program 1 times [2022-04-28 02:01:07,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:07,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526541788] [2022-04-28 02:01:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:07,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {12982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {12976#true} is VALID [2022-04-28 02:01:07,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-28 02:01:07,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12976#true} {12976#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-28 02:01:07,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {12976#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {12982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {12976#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {12976#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {12976#true} [219] L68-2-->L72-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[] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {12976#true} [221] L72-1-->L76-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[] {12976#true} is VALID [2022-04-28 02:01:07,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {12976#true} [223] L76-1-->L80-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[] {12976#true} is VALID [2022-04-28 02:01:07,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#true} [224] L80-1-->L84-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] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {12981#(= main_~lk5~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {12981#(= main_~lk5~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {12981#(= main_~lk5~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {12981#(= main_~lk5~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {12981#(= main_~lk5~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {12981#(= main_~lk5~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {12981#(= main_~lk5~0 1)} [241] L110-1-->L115-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[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {12981#(= main_~lk5~0 1)} [247] L115-1-->L120-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[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {12981#(= main_~lk5~0 1)} [251] L120-1-->L125-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[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {12981#(= main_~lk5~0 1)} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-28 02:01:07,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {12981#(= main_~lk5~0 1)} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {12977#false} is VALID [2022-04-28 02:01:07,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {12977#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12977#false} is VALID [2022-04-28 02:01:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:07,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:07,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526541788] [2022-04-28 02:01:07,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526541788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:07,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:07,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:07,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566305866] [2022-04-28 02:01:07,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:07,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:01:07,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:07,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:07,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:07,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:07,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:07,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:07,268 INFO L87 Difference]: Start difference. First operand 505 states and 807 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:07,415 INFO L93 Difference]: Finished difference Result 909 states and 1481 transitions. [2022-04-28 02:01:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:07,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:01:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 02:01:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 02:01:07,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 02:01:07,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:07,510 INFO L225 Difference]: With dead ends: 909 [2022-04-28 02:01:07,510 INFO L226 Difference]: Without dead ends: 907 [2022-04-28 02:01:07,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:07,510 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:07,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-28 02:01:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-28 02:01:07,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:07,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,522 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,543 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:07,568 INFO L93 Difference]: Finished difference Result 907 states and 1464 transitions. [2022-04-28 02:01:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1464 transitions. [2022-04-28 02:01:07,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:07,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:07,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 907 states. [2022-04-28 02:01:07,571 INFO L87 Difference]: Start difference. First operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 907 states. [2022-04-28 02:01:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:07,597 INFO L93 Difference]: Finished difference Result 907 states and 1464 transitions. [2022-04-28 02:01:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1464 transitions. [2022-04-28 02:01:07,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:07,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:07,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:07,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1111 transitions. [2022-04-28 02:01:07,616 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1111 transitions. Word has length 25 [2022-04-28 02:01:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:07,616 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1111 transitions. [2022-04-28 02:01:07,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1111 transitions. [2022-04-28 02:01:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:01:07,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:07,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:07,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 02:01:07,618 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1247966064, now seen corresponding path program 1 times [2022-04-28 02:01:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:07,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844951806] [2022-04-28 02:01:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:07,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {16492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {16486#true} is VALID [2022-04-28 02:01:07,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {16486#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-28 02:01:07,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16486#true} {16486#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-28 02:01:07,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {16486#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:07,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {16492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {16486#true} is VALID [2022-04-28 02:01:07,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {16486#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-28 02:01:07,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16486#true} {16486#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-28 02:01:07,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {16486#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-28 02:01:07,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {16486#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {16486#true} is VALID [2022-04-28 02:01:07,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {16486#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {16486#true} is VALID [2022-04-28 02:01:07,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {16486#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {16486#true} is VALID [2022-04-28 02:01:07,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {16486#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-28 02:01:07,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {16486#true} [219] L68-2-->L72-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[] {16486#true} is VALID [2022-04-28 02:01:07,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {16486#true} [221] L72-1-->L76-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[] {16486#true} is VALID [2022-04-28 02:01:07,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {16486#true} [223] L76-1-->L80-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[] {16486#true} is VALID [2022-04-28 02:01:07,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {16486#true} [225] L80-1-->L84-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {16491#(= main_~p5~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {16491#(= main_~p5~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {16491#(= main_~p5~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {16491#(= main_~p5~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {16491#(= main_~p5~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {16491#(= main_~p5~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {16491#(= main_~p5~0 0)} [241] L110-1-->L115-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {16491#(= main_~p5~0 0)} [247] L115-1-->L120-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {16491#(= main_~p5~0 0)} [251] L120-1-->L125-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-28 02:01:07,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {16491#(= main_~p5~0 0)} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {16487#false} is VALID [2022-04-28 02:01:07,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {16487#false} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {16487#false} is VALID [2022-04-28 02:01:07,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {16487#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16487#false} is VALID [2022-04-28 02:01:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:07,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844951806] [2022-04-28 02:01:07,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844951806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:07,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:07,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592672560] [2022-04-28 02:01:07,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:07,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:01:07,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:07,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:07,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:07,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:07,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:07,665 INFO L87 Difference]: Start difference. First operand 713 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:07,867 INFO L93 Difference]: Finished difference Result 1661 states and 2601 transitions. [2022-04-28 02:01:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:07,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 02:01:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-28 02:01:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-28 02:01:07,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-28 02:01:07,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:07,995 INFO L225 Difference]: With dead ends: 1661 [2022-04-28 02:01:07,995 INFO L226 Difference]: Without dead ends: 971 [2022-04-28 02:01:07,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:07,996 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:07,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-28 02:01:08,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-28 02:01:08,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:08,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,011 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,012 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:08,039 INFO L93 Difference]: Finished difference Result 971 states and 1496 transitions. [2022-04-28 02:01:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1496 transitions. [2022-04-28 02:01:08,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:08,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:08,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 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 971 states. [2022-04-28 02:01:08,042 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 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 971 states. [2022-04-28 02:01:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:08,072 INFO L93 Difference]: Finished difference Result 971 states and 1496 transitions. [2022-04-28 02:01:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1496 transitions. [2022-04-28 02:01:08,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:08,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:08,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:08,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1495 transitions. [2022-04-28 02:01:08,102 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1495 transitions. Word has length 25 [2022-04-28 02:01:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1495 transitions. [2022-04-28 02:01:08,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1495 transitions. [2022-04-28 02:01:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:01:08,103 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:08,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:08,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 02:01:08,103 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:08,103 INFO L85 PathProgramCache]: Analyzing trace with hash 537833458, now seen corresponding path program 1 times [2022-04-28 02:01:08,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:08,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526573727] [2022-04-28 02:01:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:08,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {21170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {21164#true} is VALID [2022-04-28 02:01:08,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {21164#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-28 02:01:08,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21164#true} {21164#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-28 02:01:08,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {21164#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:08,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {21170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {21164#true} is VALID [2022-04-28 02:01:08,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {21164#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-28 02:01:08,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21164#true} {21164#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-28 02:01:08,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {21164#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-28 02:01:08,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {21164#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {21164#true} is VALID [2022-04-28 02:01:08,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {21164#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {21164#true} is VALID [2022-04-28 02:01:08,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {21164#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {21164#true} is VALID [2022-04-28 02:01:08,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {21164#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-28 02:01:08,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {21164#true} [219] L68-2-->L72-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[] {21164#true} is VALID [2022-04-28 02:01:08,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {21164#true} [221] L72-1-->L76-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[] {21164#true} is VALID [2022-04-28 02:01:08,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {21164#true} [223] L76-1-->L80-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[] {21164#true} is VALID [2022-04-28 02:01:08,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {21164#true} [224] L80-1-->L84-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] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {21169#(not (= main_~p5~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {21169#(not (= main_~p5~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {21169#(not (= main_~p5~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {21169#(not (= main_~p5~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {21169#(not (= main_~p5~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {21169#(not (= main_~p5~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {21169#(not (= main_~p5~0 0))} [241] L110-1-->L115-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[] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {21169#(not (= main_~p5~0 0))} [247] L115-1-->L120-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[] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {21169#(not (= main_~p5~0 0))} [251] L120-1-->L125-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[] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:01:08,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {21169#(not (= main_~p5~0 0))} [255] L125-1-->L130-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[] {21165#false} is VALID [2022-04-28 02:01:08,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {21165#false} [258] L130-1-->L136: 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[] {21165#false} is VALID [2022-04-28 02:01:08,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {21165#false} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {21165#false} is VALID [2022-04-28 02:01:08,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {21165#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21165#false} is VALID [2022-04-28 02:01:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:08,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526573727] [2022-04-28 02:01:08,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526573727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:08,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:08,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113628835] [2022-04-28 02:01:08,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:08,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:01:08,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:08,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:08,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:08,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:08,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:08,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:08,148 INFO L87 Difference]: Start difference. First operand 969 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:08,321 INFO L93 Difference]: Finished difference Result 1453 states and 2233 transitions. [2022-04-28 02:01:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:08,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:01:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 02:01:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 02:01:08,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-28 02:01:08,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:08,473 INFO L225 Difference]: With dead ends: 1453 [2022-04-28 02:01:08,473 INFO L226 Difference]: Without dead ends: 987 [2022-04-28 02:01:08,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:08,474 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:08,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-28 02:01:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-28 02:01:08,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:08,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,490 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,491 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:08,519 INFO L93 Difference]: Finished difference Result 987 states and 1496 transitions. [2022-04-28 02:01:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1496 transitions. [2022-04-28 02:01:08,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:08,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:08,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 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 987 states. [2022-04-28 02:01:08,522 INFO L87 Difference]: Start difference. First operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 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 987 states. [2022-04-28 02:01:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:08,550 INFO L93 Difference]: Finished difference Result 987 states and 1496 transitions. [2022-04-28 02:01:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1496 transitions. [2022-04-28 02:01:08,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:08,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:08,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:08,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1495 transitions. [2022-04-28 02:01:08,580 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1495 transitions. Word has length 26 [2022-04-28 02:01:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:08,581 INFO L495 AbstractCegarLoop]: Abstraction has 985 states and 1495 transitions. [2022-04-28 02:01:08,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1495 transitions. [2022-04-28 02:01:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:01:08,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:08,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:08,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 02:01:08,582 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash 32274833, now seen corresponding path program 1 times [2022-04-28 02:01:08,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:08,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943609449] [2022-04-28 02:01:08,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:08,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:08,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {25688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {25682#true} is VALID [2022-04-28 02:01:08,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {25682#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-28 02:01:08,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25682#true} {25682#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-28 02:01:08,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {25682#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:08,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {25688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {25682#true} is VALID [2022-04-28 02:01:08,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {25682#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25682#true} {25682#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {25682#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {25682#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {25682#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {25682#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {25682#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {25682#true} [219] L68-2-->L72-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[] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {25682#true} [221] L72-1-->L76-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[] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {25682#true} [223] L76-1-->L80-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[] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {25682#true} [225] L80-1-->L84-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[] {25682#true} is VALID [2022-04-28 02:01:08,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {25682#true} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {25687#(= main_~lk6~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {25687#(= main_~lk6~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {25687#(= main_~lk6~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {25687#(= main_~lk6~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {25687#(= main_~lk6~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {25687#(= main_~lk6~0 1)} [241] L110-1-->L115-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {25687#(= main_~lk6~0 1)} [247] L115-1-->L120-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {25687#(= main_~lk6~0 1)} [251] L120-1-->L125-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {25687#(= main_~lk6~0 1)} [255] L125-1-->L130-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {25687#(= main_~lk6~0 1)} [258] L130-1-->L136: 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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-28 02:01:08,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {25687#(= main_~lk6~0 1)} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {25683#false} is VALID [2022-04-28 02:01:08,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {25683#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25683#false} is VALID [2022-04-28 02:01:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:08,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:08,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943609449] [2022-04-28 02:01:08,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943609449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:08,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:08,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121943641] [2022-04-28 02:01:08,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:08,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:01:08,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:08,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:08,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:08,656 INFO L87 Difference]: Start difference. First operand 985 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:08,883 INFO L93 Difference]: Finished difference Result 1741 states and 2697 transitions. [2022-04-28 02:01:08,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:08,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:01:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 02:01:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 02:01:08,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 02:01:08,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:09,031 INFO L225 Difference]: With dead ends: 1741 [2022-04-28 02:01:09,031 INFO L226 Difference]: Without dead ends: 1739 [2022-04-28 02:01:09,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:09,032 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:09,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-28 02:01:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-28 02:01:09,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:09,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,052 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,053 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:09,131 INFO L93 Difference]: Finished difference Result 1739 states and 2664 transitions. [2022-04-28 02:01:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2664 transitions. [2022-04-28 02:01:09,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:09,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:09,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1739 states. [2022-04-28 02:01:09,136 INFO L87 Difference]: Start difference. First operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1739 states. [2022-04-28 02:01:09,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:09,216 INFO L93 Difference]: Finished difference Result 1739 states and 2664 transitions. [2022-04-28 02:01:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2664 transitions. [2022-04-28 02:01:09,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:09,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:09,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:09,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2087 transitions. [2022-04-28 02:01:09,270 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2087 transitions. Word has length 26 [2022-04-28 02:01:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:09,270 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 2087 transitions. [2022-04-28 02:01:09,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2087 transitions. [2022-04-28 02:01:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:01:09,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:09,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:09,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 02:01:09,272 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash -261128174, now seen corresponding path program 1 times [2022-04-28 02:01:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:09,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637954035] [2022-04-28 02:01:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:09,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:09,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:09,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {32446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {32440#true} is VALID [2022-04-28 02:01:09,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {32440#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-28 02:01:09,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32440#true} {32440#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {32440#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:09,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {32446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {32440#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32440#true} {32440#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {32440#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {32440#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {32440#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {32440#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {32440#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {32440#true} [219] L68-2-->L72-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[] {32440#true} is VALID [2022-04-28 02:01:09,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {32440#true} [221] L72-1-->L76-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[] {32440#true} is VALID [2022-04-28 02:01:09,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {32440#true} [223] L76-1-->L80-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[] {32440#true} is VALID [2022-04-28 02:01:09,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {32440#true} [225] L80-1-->L84-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[] {32440#true} is VALID [2022-04-28 02:01:09,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {32440#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {32445#(= main_~p6~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {32445#(= main_~p6~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {32445#(= main_~p6~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {32445#(= main_~p6~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {32445#(= main_~p6~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {32445#(= main_~p6~0 0)} [241] L110-1-->L115-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {32445#(= main_~p6~0 0)} [247] L115-1-->L120-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {32445#(= main_~p6~0 0)} [251] L120-1-->L125-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {32445#(= main_~p6~0 0)} [255] L125-1-->L130-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-28 02:01:09,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {32445#(= main_~p6~0 0)} [258] L130-1-->L136: 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[] {32441#false} is VALID [2022-04-28 02:01:09,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {32441#false} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {32441#false} is VALID [2022-04-28 02:01:09,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {32441#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32441#false} is VALID [2022-04-28 02:01:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:09,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637954035] [2022-04-28 02:01:09,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637954035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:09,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:09,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713654848] [2022-04-28 02:01:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:01:09,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:09,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:09,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:09,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:09,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:09,315 INFO L87 Difference]: Start difference. First operand 1417 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:09,725 INFO L93 Difference]: Finished difference Result 3277 states and 4841 transitions. [2022-04-28 02:01:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:09,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:01:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-28 02:01:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-28 02:01:09,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-28 02:01:09,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:09,937 INFO L225 Difference]: With dead ends: 3277 [2022-04-28 02:01:09,937 INFO L226 Difference]: Without dead ends: 1899 [2022-04-28 02:01:09,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:09,940 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:09,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-28 02:01:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-28 02:01:09,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:09,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,969 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:09,970 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:10,080 INFO L93 Difference]: Finished difference Result 1899 states and 2760 transitions. [2022-04-28 02:01:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2760 transitions. [2022-04-28 02:01:10,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:10,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:10,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 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 1899 states. [2022-04-28 02:01:10,086 INFO L87 Difference]: Start difference. First operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 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 1899 states. [2022-04-28 02:01:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:10,186 INFO L93 Difference]: Finished difference Result 1899 states and 2760 transitions. [2022-04-28 02:01:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2760 transitions. [2022-04-28 02:01:10,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:10,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:10,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:10,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2759 transitions. [2022-04-28 02:01:10,291 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2759 transitions. Word has length 26 [2022-04-28 02:01:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:10,291 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 2759 transitions. [2022-04-28 02:01:10,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2759 transitions. [2022-04-28 02:01:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 02:01:10,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:10,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:10,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 02:01:10,293 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:10,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1000552460, now seen corresponding path program 1 times [2022-04-28 02:01:10,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:10,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580021605] [2022-04-28 02:01:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:10,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {41604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {41598#true} is VALID [2022-04-28 02:01:10,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {41598#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-28 02:01:10,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41598#true} {41598#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-28 02:01:10,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {41598#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:10,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {41604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {41598#true} is VALID [2022-04-28 02:01:10,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {41598#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-28 02:01:10,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41598#true} {41598#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-28 02:01:10,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {41598#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-28 02:01:10,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {41598#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {41598#true} is VALID [2022-04-28 02:01:10,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {41598#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {41598#true} is VALID [2022-04-28 02:01:10,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {41598#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {41598#true} is VALID [2022-04-28 02:01:10,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {41598#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-28 02:01:10,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {41598#true} [219] L68-2-->L72-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[] {41598#true} is VALID [2022-04-28 02:01:10,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {41598#true} [221] L72-1-->L76-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[] {41598#true} is VALID [2022-04-28 02:01:10,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {41598#true} [223] L76-1-->L80-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[] {41598#true} is VALID [2022-04-28 02:01:10,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {41598#true} [225] L80-1-->L84-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[] {41598#true} is VALID [2022-04-28 02:01:10,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {41598#true} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {41603#(not (= main_~p6~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {41603#(not (= main_~p6~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {41603#(not (= main_~p6~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {41603#(not (= main_~p6~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {41603#(not (= main_~p6~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {41603#(not (= main_~p6~0 0))} [241] L110-1-->L115-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {41603#(not (= main_~p6~0 0))} [247] L115-1-->L120-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {41603#(not (= main_~p6~0 0))} [251] L120-1-->L125-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {41603#(not (= main_~p6~0 0))} [255] L125-1-->L130-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:01:10,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {41603#(not (= main_~p6~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {41599#false} is VALID [2022-04-28 02:01:10,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {41599#false} [262] L135-1-->L141: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {41599#false} is VALID [2022-04-28 02:01:10,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {41599#false} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {41599#false} is VALID [2022-04-28 02:01:10,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {41599#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41599#false} is VALID [2022-04-28 02:01:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:10,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580021605] [2022-04-28 02:01:10,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580021605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:10,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:10,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653138300] [2022-04-28 02:01:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:10,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:01:10,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:10,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:10,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:10,338 INFO L87 Difference]: Start difference. First operand 1897 states and 2759 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:10,695 INFO L93 Difference]: Finished difference Result 2845 states and 4121 transitions. [2022-04-28 02:01:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:01:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 02:01:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 02:01:10,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-28 02:01:10,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:10,913 INFO L225 Difference]: With dead ends: 2845 [2022-04-28 02:01:10,913 INFO L226 Difference]: Without dead ends: 1931 [2022-04-28 02:01:10,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:10,917 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:10,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 98 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-28 02:01:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-28 02:01:10,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:10,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,947 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:10,948 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:11,037 INFO L93 Difference]: Finished difference Result 1931 states and 2760 transitions. [2022-04-28 02:01:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2760 transitions. [2022-04-28 02:01:11,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:11,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:11,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 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 1931 states. [2022-04-28 02:01:11,043 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 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 1931 states. [2022-04-28 02:01:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:11,133 INFO L93 Difference]: Finished difference Result 1931 states and 2760 transitions. [2022-04-28 02:01:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2760 transitions. [2022-04-28 02:01:11,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:11,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:11,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:11,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2759 transitions. [2022-04-28 02:01:11,232 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2759 transitions. Word has length 27 [2022-04-28 02:01:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:11,232 INFO L495 AbstractCegarLoop]: Abstraction has 1929 states and 2759 transitions. [2022-04-28 02:01:11,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2759 transitions. [2022-04-28 02:01:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 02:01:11,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:11,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 02:01:11,234 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 494993835, now seen corresponding path program 1 times [2022-04-28 02:01:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:11,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431959916] [2022-04-28 02:01:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:11,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {50426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {50420#true} is VALID [2022-04-28 02:01:11,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {50420#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-28 02:01:11,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50420#true} {50420#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-28 02:01:11,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {50420#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:11,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {50426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {50420#true} is VALID [2022-04-28 02:01:11,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {50420#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-28 02:01:11,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50420#true} {50420#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-28 02:01:11,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {50420#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {50420#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {50420#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {50420#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {50420#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {50420#true} [219] L68-2-->L72-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[] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {50420#true} [221] L72-1-->L76-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[] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {50420#true} [223] L76-1-->L80-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[] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {50420#true} [225] L80-1-->L84-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[] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {50420#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-28 02:01:11,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {50420#true} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {50425#(= main_~lk7~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {50425#(= main_~lk7~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {50425#(= main_~lk7~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {50425#(= main_~lk7~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {50425#(= main_~lk7~0 1)} [241] L110-1-->L115-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {50425#(= main_~lk7~0 1)} [247] L115-1-->L120-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {50425#(= main_~lk7~0 1)} [251] L120-1-->L125-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {50425#(= main_~lk7~0 1)} [255] L125-1-->L130-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {50425#(= main_~lk7~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {50425#(= main_~lk7~0 1)} [262] L135-1-->L141: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-28 02:01:11,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {50425#(= main_~lk7~0 1)} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {50421#false} is VALID [2022-04-28 02:01:11,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {50421#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50421#false} is VALID [2022-04-28 02:01:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:11,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:11,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431959916] [2022-04-28 02:01:11,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431959916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:11,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:11,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750116147] [2022-04-28 02:01:11,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:01:11,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:11,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:11,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:11,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:11,288 INFO L87 Difference]: Start difference. First operand 1929 states and 2759 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:11,736 INFO L93 Difference]: Finished difference Result 3341 states and 4873 transitions. [2022-04-28 02:01:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:11,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:01:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 02:01:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 02:01:11,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-28 02:01:11,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:12,145 INFO L225 Difference]: With dead ends: 3341 [2022-04-28 02:01:12,145 INFO L226 Difference]: Without dead ends: 3339 [2022-04-28 02:01:12,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:12,147 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:12,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-28 02:01:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-28 02:01:12,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:12,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:12,190 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:12,191 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:12,485 INFO L93 Difference]: Finished difference Result 3339 states and 4808 transitions. [2022-04-28 02:01:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4808 transitions. [2022-04-28 02:01:12,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:12,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:12,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3339 states. [2022-04-28 02:01:12,493 INFO L87 Difference]: Start difference. First operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3339 states. [2022-04-28 02:01:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:12,781 INFO L93 Difference]: Finished difference Result 3339 states and 4808 transitions. [2022-04-28 02:01:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4808 transitions. [2022-04-28 02:01:12,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:12,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:12,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:12,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3911 transitions. [2022-04-28 02:01:13,002 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3911 transitions. Word has length 27 [2022-04-28 02:01:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:13,002 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3911 transitions. [2022-04-28 02:01:13,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3911 transitions. [2022-04-28 02:01:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 02:01:13,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:13,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:13,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 02:01:13,005 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash 201590828, now seen corresponding path program 1 times [2022-04-28 02:01:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:13,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244596757] [2022-04-28 02:01:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:13,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:13,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {63488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {63482#true} is VALID [2022-04-28 02:01:13,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {63482#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-28 02:01:13,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63482#true} {63482#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {63482#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:13,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {63488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {63482#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63482#true} {63482#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {63482#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {63482#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {63482#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {63482#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {63482#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-28 02:01:13,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {63482#true} [219] L68-2-->L72-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[] {63482#true} is VALID [2022-04-28 02:01:13,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {63482#true} [221] L72-1-->L76-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[] {63482#true} is VALID [2022-04-28 02:01:13,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {63482#true} [223] L76-1-->L80-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[] {63482#true} is VALID [2022-04-28 02:01:13,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {63482#true} [225] L80-1-->L84-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[] {63482#true} is VALID [2022-04-28 02:01:13,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {63482#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-28 02:01:13,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {63482#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {63487#(= main_~p7~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {63487#(= main_~p7~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {63487#(= main_~p7~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {63487#(= main_~p7~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {63487#(= main_~p7~0 0)} [241] L110-1-->L115-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {63487#(= main_~p7~0 0)} [247] L115-1-->L120-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {63487#(= main_~p7~0 0)} [251] L120-1-->L125-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {63487#(= main_~p7~0 0)} [255] L125-1-->L130-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {63487#(= main_~p7~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {63487#(= main_~p7~0 0)} is VALID [2022-04-28 02:01:13,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {63487#(= main_~p7~0 0)} [262] L135-1-->L141: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {63483#false} is VALID [2022-04-28 02:01:13,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {63483#false} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {63483#false} is VALID [2022-04-28 02:01:13,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {63483#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63483#false} is VALID [2022-04-28 02:01:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:13,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:13,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244596757] [2022-04-28 02:01:13,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244596757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:13,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:13,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:13,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43452358] [2022-04-28 02:01:13,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:01:13,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:13,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:13,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:13,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:13,051 INFO L87 Difference]: Start difference. First operand 2825 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:14,376 INFO L93 Difference]: Finished difference Result 6477 states and 8969 transitions. [2022-04-28 02:01:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 02:01:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 02:01:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 02:01:14,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-28 02:01:14,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:14,891 INFO L225 Difference]: With dead ends: 6477 [2022-04-28 02:01:14,891 INFO L226 Difference]: Without dead ends: 3723 [2022-04-28 02:01:14,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:14,895 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:14,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-28 02:01:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-28 02:01:14,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:14,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:14,965 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:14,967 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:15,339 INFO L93 Difference]: Finished difference Result 3723 states and 5064 transitions. [2022-04-28 02:01:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5064 transitions. [2022-04-28 02:01:15,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:15,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:15,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 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 3723 states. [2022-04-28 02:01:15,348 INFO L87 Difference]: Start difference. First operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 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 3723 states. [2022-04-28 02:01:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:15,713 INFO L93 Difference]: Finished difference Result 3723 states and 5064 transitions. [2022-04-28 02:01:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5064 transitions. [2022-04-28 02:01:15,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:15,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:15,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:15,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5063 transitions. [2022-04-28 02:01:16,128 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5063 transitions. Word has length 27 [2022-04-28 02:01:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:16,128 INFO L495 AbstractCegarLoop]: Abstraction has 3721 states and 5063 transitions. [2022-04-28 02:01:16,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5063 transitions. [2022-04-28 02:01:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:01:16,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:16,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:16,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 02:01:16,130 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:16,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1835027538, now seen corresponding path program 1 times [2022-04-28 02:01:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:16,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591416217] [2022-04-28 02:01:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:16,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {81478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {81472#true} is VALID [2022-04-28 02:01:16,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {81472#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-28 02:01:16,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81472#true} {81472#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-28 02:01:16,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {81472#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:16,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {81478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {81472#true} is VALID [2022-04-28 02:01:16,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {81472#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-28 02:01:16,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81472#true} {81472#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-28 02:01:16,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {81472#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-28 02:01:16,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {81472#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {81472#true} is VALID [2022-04-28 02:01:16,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {81472#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {81472#true} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {81472#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {81472#true} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {81472#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {81472#true} [219] L68-2-->L72-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[] {81472#true} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {81472#true} [221] L72-1-->L76-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[] {81472#true} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {81472#true} [223] L76-1-->L80-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[] {81472#true} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {81472#true} [225] L80-1-->L84-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[] {81472#true} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {81472#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {81472#true} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {81477#(not (= main_~p7~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {81477#(not (= main_~p7~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {81477#(not (= main_~p7~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {81477#(not (= main_~p7~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {81477#(not (= main_~p7~0 0))} [241] L110-1-->L115-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {81477#(not (= main_~p7~0 0))} [247] L115-1-->L120-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {81477#(not (= main_~p7~0 0))} [251] L120-1-->L125-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {81477#(not (= main_~p7~0 0))} [255] L125-1-->L130-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {81477#(not (= main_~p7~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:01:16,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {81477#(not (= main_~p7~0 0))} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {81473#false} is VALID [2022-04-28 02:01:16,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {81473#false} [266] L140-1-->L146: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {81473#false} is VALID [2022-04-28 02:01:16,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {81473#false} [268] L146-->L156-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {81473#false} is VALID [2022-04-28 02:01:16,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {81473#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81473#false} is VALID [2022-04-28 02:01:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:16,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591416217] [2022-04-28 02:01:16,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591416217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:16,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:16,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794617053] [2022-04-28 02:01:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:16,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:01:16,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:16,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:16,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:16,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:16,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:16,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:16,182 INFO L87 Difference]: Start difference. First operand 3721 states and 5063 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:17,156 INFO L93 Difference]: Finished difference Result 5581 states and 7561 transitions. [2022-04-28 02:01:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:01:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 02:01:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 02:01:17,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-28 02:01:17,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:17,702 INFO L225 Difference]: With dead ends: 5581 [2022-04-28 02:01:17,702 INFO L226 Difference]: Without dead ends: 3787 [2022-04-28 02:01:17,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:17,716 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:17,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-28 02:01:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-28 02:01:17,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:17,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:17,784 INFO L74 IsIncluded]: Start isIncluded. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:17,788 INFO L87 Difference]: Start difference. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:18,166 INFO L93 Difference]: Finished difference Result 3787 states and 5064 transitions. [2022-04-28 02:01:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5064 transitions. [2022-04-28 02:01:18,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:18,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:18,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 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 3787 states. [2022-04-28 02:01:18,175 INFO L87 Difference]: Start difference. First operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 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 3787 states. [2022-04-28 02:01:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:18,557 INFO L93 Difference]: Finished difference Result 3787 states and 5064 transitions. [2022-04-28 02:01:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5064 transitions. [2022-04-28 02:01:18,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:18,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:18,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:18,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5063 transitions. [2022-04-28 02:01:19,000 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5063 transitions. Word has length 28 [2022-04-28 02:01:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:19,000 INFO L495 AbstractCegarLoop]: Abstraction has 3785 states and 5063 transitions. [2022-04-28 02:01:19,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5063 transitions. [2022-04-28 02:01:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:01:19,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:19,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:19,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 02:01:19,002 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:19,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1954381133, now seen corresponding path program 1 times [2022-04-28 02:01:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:19,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782463825] [2022-04-28 02:01:19,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:19,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:19,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {98764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {98758#true} is VALID [2022-04-28 02:01:19,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {98758#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-28 02:01:19,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98758#true} {98758#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {98758#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {98764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {98758#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98758#true} {98758#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {98758#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {98758#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {98758#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {98758#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {98758#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {98758#true} [219] L68-2-->L72-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[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {98758#true} [221] L72-1-->L76-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[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {98758#true} [223] L76-1-->L80-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[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {98758#true} [225] L80-1-->L84-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[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {98758#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-28 02:01:19,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {98758#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-28 02:01:19,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {98758#true} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {98763#(= main_~lk8~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {98763#(= main_~lk8~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {98763#(= main_~lk8~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {98763#(= main_~lk8~0 1)} [241] L110-1-->L115-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {98763#(= main_~lk8~0 1)} [247] L115-1-->L120-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {98763#(= main_~lk8~0 1)} [251] L120-1-->L125-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {98763#(= main_~lk8~0 1)} [255] L125-1-->L130-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {98763#(= main_~lk8~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {98763#(= main_~lk8~0 1)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {98763#(= main_~lk8~0 1)} [266] L140-1-->L146: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-28 02:01:19,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {98763#(= main_~lk8~0 1)} [268] L146-->L156-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {98759#false} is VALID [2022-04-28 02:01:19,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {98759#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98759#false} is VALID [2022-04-28 02:01:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:19,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:19,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782463825] [2022-04-28 02:01:19,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782463825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:19,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:19,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:19,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224861571] [2022-04-28 02:01:19,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:01:19,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:19,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:19,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:19,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:19,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:19,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:19,048 INFO L87 Difference]: Start difference. First operand 3785 states and 5063 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:20,430 INFO L93 Difference]: Finished difference Result 6413 states and 8713 transitions. [2022-04-28 02:01:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:20,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:01:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 02:01:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 02:01:20,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 02:01:20,512 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-28 02:01:21,701 INFO L225 Difference]: With dead ends: 6413 [2022-04-28 02:01:21,701 INFO L226 Difference]: Without dead ends: 6411 [2022-04-28 02:01:21,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:21,702 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:21,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-28 02:01:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-28 02:01:21,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:21,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:21,774 INFO L74 IsIncluded]: Start isIncluded. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:21,778 INFO L87 Difference]: Start difference. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:22,914 INFO L93 Difference]: Finished difference Result 6411 states and 8584 transitions. [2022-04-28 02:01:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8584 transitions. [2022-04-28 02:01:22,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:22,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:22,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 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 6411 states. [2022-04-28 02:01:22,930 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 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 6411 states. [2022-04-28 02:01:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:24,096 INFO L93 Difference]: Finished difference Result 6411 states and 8584 transitions. [2022-04-28 02:01:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8584 transitions. [2022-04-28 02:01:24,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:24,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:24,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:24,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7303 transitions. [2022-04-28 02:01:25,027 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7303 transitions. Word has length 28 [2022-04-28 02:01:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:25,027 INFO L495 AbstractCegarLoop]: Abstraction has 5641 states and 7303 transitions. [2022-04-28 02:01:25,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7303 transitions. [2022-04-28 02:01:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:01:25,030 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:25,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:25,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 02:01:25,030 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1660978126, now seen corresponding path program 1 times [2022-04-28 02:01:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:25,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97884702] [2022-04-28 02:01:25,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:25,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:25,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {124050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {124044#true} is VALID [2022-04-28 02:01:25,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {124044#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-28 02:01:25,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124044#true} {124044#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-28 02:01:25,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {124044#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:25,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {124050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {124044#true} is VALID [2022-04-28 02:01:25,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {124044#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-28 02:01:25,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124044#true} {124044#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-28 02:01:25,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {124044#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-28 02:01:25,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {124044#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {124044#true} is VALID [2022-04-28 02:01:25,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {124044#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {124044#true} is VALID [2022-04-28 02:01:25,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {124044#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {124044#true} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {124044#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {124044#true} [219] L68-2-->L72-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[] {124044#true} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {124044#true} [221] L72-1-->L76-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[] {124044#true} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {124044#true} [223] L76-1-->L80-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[] {124044#true} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {124044#true} [225] L80-1-->L84-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[] {124044#true} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {124044#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {124044#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {124044#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {124049#(= main_~p8~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {124049#(= main_~p8~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {124049#(= main_~p8~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {124049#(= main_~p8~0 0)} [241] L110-1-->L115-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {124049#(= main_~p8~0 0)} [247] L115-1-->L120-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {124049#(= main_~p8~0 0)} [251] L120-1-->L125-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {124049#(= main_~p8~0 0)} [255] L125-1-->L130-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {124049#(= main_~p8~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {124049#(= main_~p8~0 0)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {124049#(= main_~p8~0 0)} is VALID [2022-04-28 02:01:25,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {124049#(= main_~p8~0 0)} [266] L140-1-->L146: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {124045#false} is VALID [2022-04-28 02:01:25,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {124045#false} [268] L146-->L156-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {124045#false} is VALID [2022-04-28 02:01:25,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {124045#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124045#false} is VALID [2022-04-28 02:01:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:25,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97884702] [2022-04-28 02:01:25,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97884702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:25,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:25,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088993015] [2022-04-28 02:01:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:25,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:01:25,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:25,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:25,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:25,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:25,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:25,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:25,104 INFO L87 Difference]: Start difference. First operand 5641 states and 7303 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:29,972 INFO L93 Difference]: Finished difference Result 12813 states and 16521 transitions. [2022-04-28 02:01:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:01:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 02:01:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 02:01:29,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-28 02:01:30,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:31,613 INFO L225 Difference]: With dead ends: 12813 [2022-04-28 02:01:31,613 INFO L226 Difference]: Without dead ends: 7307 [2022-04-28 02:01:31,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:31,618 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:31,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-28 02:01:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-28 02:01:31,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:31,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:31,710 INFO L74 IsIncluded]: Start isIncluded. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:31,715 INFO L87 Difference]: Start difference. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:33,112 INFO L93 Difference]: Finished difference Result 7307 states and 9224 transitions. [2022-04-28 02:01:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9224 transitions. [2022-04-28 02:01:33,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:33,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:33,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 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 7307 states. [2022-04-28 02:01:33,157 INFO L87 Difference]: Start difference. First operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 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 7307 states. [2022-04-28 02:01:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:34,588 INFO L93 Difference]: Finished difference Result 7307 states and 9224 transitions. [2022-04-28 02:01:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9224 transitions. [2022-04-28 02:01:34,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:34,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:34,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:34,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9223 transitions. [2022-04-28 02:01:36,093 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9223 transitions. Word has length 28 [2022-04-28 02:01:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:36,093 INFO L495 AbstractCegarLoop]: Abstraction has 7305 states and 9223 transitions. [2022-04-28 02:01:36,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9223 transitions. [2022-04-28 02:01:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 02:01:36,096 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:36,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:36,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 02:01:36,096 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 456305864, now seen corresponding path program 1 times [2022-04-28 02:01:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:36,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993436790] [2022-04-28 02:01:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:36,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {159448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {159442#true} is VALID [2022-04-28 02:01:36,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {159442#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-28 02:01:36,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159442#true} {159442#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-28 02:01:36,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {159442#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:36,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {159448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {159442#true} is VALID [2022-04-28 02:01:36,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {159442#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-28 02:01:36,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159442#true} {159442#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {159442#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {159442#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {159442#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {159442#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {159442#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {159442#true} [219] L68-2-->L72-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[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {159442#true} [221] L72-1-->L76-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[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {159442#true} [223] L76-1-->L80-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[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {159442#true} [225] L80-1-->L84-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[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {159442#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {159442#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-28 02:01:36,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {159442#true} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {159447#(not (= main_~p8~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {159447#(not (= main_~p8~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {159447#(not (= main_~p8~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {159447#(not (= main_~p8~0 0))} [241] L110-1-->L115-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {159447#(not (= main_~p8~0 0))} [247] L115-1-->L120-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {159447#(not (= main_~p8~0 0))} [251] L120-1-->L125-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {159447#(not (= main_~p8~0 0))} [255] L125-1-->L130-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {159447#(not (= main_~p8~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {159447#(not (= main_~p8~0 0))} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-28 02:01:36,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {159447#(not (= main_~p8~0 0))} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {159443#false} is VALID [2022-04-28 02:01:36,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {159443#false} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {159443#false} is VALID [2022-04-28 02:01:36,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {159443#false} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {159443#false} is VALID [2022-04-28 02:01:36,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {159443#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159443#false} is VALID [2022-04-28 02:01:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:36,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:36,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993436790] [2022-04-28 02:01:36,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993436790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:36,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:36,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415846870] [2022-04-28 02:01:36,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 02:01:36,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:36,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:36,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:36,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:36,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:36,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:36,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:36,173 INFO L87 Difference]: Start difference. First operand 7305 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:39,326 INFO L93 Difference]: Finished difference Result 10957 states and 13769 transitions. [2022-04-28 02:01:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:39,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 02:01:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-28 02:01:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-28 02:01:39,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-28 02:01:39,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:41,082 INFO L225 Difference]: With dead ends: 10957 [2022-04-28 02:01:41,082 INFO L226 Difference]: Without dead ends: 7435 [2022-04-28 02:01:41,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:41,087 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:41,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-28 02:01:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-28 02:01:41,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:41,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:41,232 INFO L74 IsIncluded]: Start isIncluded. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:41,236 INFO L87 Difference]: Start difference. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:42,700 INFO L93 Difference]: Finished difference Result 7435 states and 9224 transitions. [2022-04-28 02:01:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9224 transitions. [2022-04-28 02:01:42,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:42,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:42,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 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 7435 states. [2022-04-28 02:01:42,714 INFO L87 Difference]: Start difference. First operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 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 7435 states. [2022-04-28 02:01:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:44,274 INFO L93 Difference]: Finished difference Result 7435 states and 9224 transitions. [2022-04-28 02:01:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9224 transitions. [2022-04-28 02:01:44,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:44,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:44,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:01:44,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:01:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9223 transitions. [2022-04-28 02:01:45,840 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9223 transitions. Word has length 29 [2022-04-28 02:01:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:01:45,840 INFO L495 AbstractCegarLoop]: Abstraction has 7433 states and 9223 transitions. [2022-04-28 02:01:45,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9223 transitions. [2022-04-28 02:01:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 02:01:45,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:01:45,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:01:45,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 02:01:45,843 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:01:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:01:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash -49252761, now seen corresponding path program 1 times [2022-04-28 02:01:45,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:01:45,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779249392] [2022-04-28 02:01:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:01:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:01:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:45,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:01:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:01:45,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {193374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {193368#true} is VALID [2022-04-28 02:01:45,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {193368#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {193368#true} {193368#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {193368#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:01:45,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {193374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {193368#true} is VALID [2022-04-28 02:01:45,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {193368#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193368#true} {193368#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {193368#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {193368#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {193368#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {193368#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {193368#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {193368#true} [219] L68-2-->L72-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[] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {193368#true} [221] L72-1-->L76-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[] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {193368#true} [223] L76-1-->L80-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[] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {193368#true} [225] L80-1-->L84-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[] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {193368#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {193368#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {193368#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-28 02:01:45,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {193368#true} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {193373#(= main_~lk9~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {193373#(= main_~lk9~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {193373#(= main_~lk9~0 1)} [241] L110-1-->L115-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {193373#(= main_~lk9~0 1)} [247] L115-1-->L120-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {193373#(= main_~lk9~0 1)} [251] L120-1-->L125-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {193373#(= main_~lk9~0 1)} [255] L125-1-->L130-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {193373#(= main_~lk9~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {193373#(= main_~lk9~0 1)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {193373#(= main_~lk9~0 1)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {193373#(= main_~lk9~0 1)} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-28 02:01:45,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {193373#(= main_~lk9~0 1)} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {193369#false} is VALID [2022-04-28 02:01:45,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {193369#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193369#false} is VALID [2022-04-28 02:01:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:01:45,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:01:45,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779249392] [2022-04-28 02:01:45,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779249392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:01:45,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:01:45,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:01:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828421554] [2022-04-28 02:01:45,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:01:45,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 02:01:45,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:01:45,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:45,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:45,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:01:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:01:45,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:01:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:01:45,890 INFO L87 Difference]: Start difference. First operand 7433 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:50,095 INFO L93 Difference]: Finished difference Result 12301 states and 15369 transitions. [2022-04-28 02:01:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:01:50,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 02:01:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:01:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 02:01:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 02:01:50,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-28 02:01:50,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:01:54,251 INFO L225 Difference]: With dead ends: 12301 [2022-04-28 02:01:54,251 INFO L226 Difference]: Without dead ends: 12299 [2022-04-28 02:01:54,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:01:54,253 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:01:54,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:01:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-28 02:01:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-28 02:01:54,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:01:54,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:54,381 INFO L74 IsIncluded]: Start isIncluded. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:54,388 INFO L87 Difference]: Start difference. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:01:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:01:58,150 INFO L93 Difference]: Finished difference Result 12299 states and 15112 transitions. [2022-04-28 02:01:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15112 transitions. [2022-04-28 02:01:58,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:01:58,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:01:58,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 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 12299 states. [2022-04-28 02:01:58,170 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 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 12299 states. [2022-04-28 02:02:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:02,400 INFO L93 Difference]: Finished difference Result 12299 states and 15112 transitions. [2022-04-28 02:02:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15112 transitions. [2022-04-28 02:02:02,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:02,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:02,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:02,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13575 transitions. [2022-04-28 02:02:05,952 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13575 transitions. Word has length 29 [2022-04-28 02:02:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:05,952 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 13575 transitions. [2022-04-28 02:02:05,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13575 transitions. [2022-04-28 02:02:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 02:02:05,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:05,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:05,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 02:02:05,958 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:05,958 INFO L85 PathProgramCache]: Analyzing trace with hash -342655768, now seen corresponding path program 1 times [2022-04-28 02:02:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:05,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916463606] [2022-04-28 02:02:05,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:05,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {242340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {242334#true} is VALID [2022-04-28 02:02:05,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {242334#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242334#true} {242334#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {242334#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:05,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {242340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {242334#true} is VALID [2022-04-28 02:02:05,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {242334#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242334#true} {242334#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {242334#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {242334#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {242334#true} is VALID [2022-04-28 02:02:05,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {242334#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {242334#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {242334#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {242334#true} [219] L68-2-->L72-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[] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {242334#true} [221] L72-1-->L76-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[] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {242334#true} [223] L76-1-->L80-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[] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {242334#true} [225] L80-1-->L84-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[] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {242334#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {242334#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {242334#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {242334#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {242339#(= main_~p9~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {242339#(= main_~p9~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {242339#(= main_~p9~0 0)} [241] L110-1-->L115-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {242339#(= main_~p9~0 0)} [247] L115-1-->L120-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {242339#(= main_~p9~0 0)} [251] L120-1-->L125-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {242339#(= main_~p9~0 0)} [255] L125-1-->L130-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {242339#(= main_~p9~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {242339#(= main_~p9~0 0)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {242339#(= main_~p9~0 0)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {242339#(= main_~p9~0 0)} is VALID [2022-04-28 02:02:05,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {242339#(= main_~p9~0 0)} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {242335#false} is VALID [2022-04-28 02:02:05,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {242335#false} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {242335#false} is VALID [2022-04-28 02:02:05,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {242335#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242335#false} is VALID [2022-04-28 02:02:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:05,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:05,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916463606] [2022-04-28 02:02:05,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916463606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:05,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:05,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:05,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219483901] [2022-04-28 02:02:05,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:05,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 02:02:05,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:05,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:06,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:06,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:06,002 INFO L87 Difference]: Start difference. First operand 11273 states and 13575 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:23,765 INFO L93 Difference]: Finished difference Result 25357 states and 30217 transitions. [2022-04-28 02:02:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:23,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 02:02:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 02:02:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 02:02:23,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-28 02:02:23,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:29,563 INFO L225 Difference]: With dead ends: 25357 [2022-04-28 02:02:29,564 INFO L226 Difference]: Without dead ends: 14347 [2022-04-28 02:02:29,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:29,571 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:29,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-28 02:02:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-28 02:02:29,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:29,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:29,863 INFO L74 IsIncluded]: Start isIncluded. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:29,871 INFO L87 Difference]: Start difference. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:35,257 INFO L93 Difference]: Finished difference Result 14347 states and 16648 transitions. [2022-04-28 02:02:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 16648 transitions. [2022-04-28 02:02:35,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:35,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:35,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 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 14347 states. [2022-04-28 02:02:35,285 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 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 14347 states. [2022-04-28 02:02:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:40,751 INFO L93 Difference]: Finished difference Result 14347 states and 16648 transitions. [2022-04-28 02:02:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 16648 transitions. [2022-04-28 02:02:40,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:40,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:40,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:40,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 16647 transitions. [2022-04-28 02:02:46,308 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 16647 transitions. Word has length 29 [2022-04-28 02:02:46,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:46,308 INFO L495 AbstractCegarLoop]: Abstraction has 14345 states and 16647 transitions. [2022-04-28 02:02:46,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 16647 transitions. [2022-04-28 02:02:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:02:46,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:46,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:46,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 02:02:46,314 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:46,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1526802582, now seen corresponding path program 1 times [2022-04-28 02:02:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:46,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843322526] [2022-04-28 02:02:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:46,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {312042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {312036#true} is VALID [2022-04-28 02:02:46,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {312036#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {312036#true} {312036#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {312036#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {312042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {312036#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {312036#true} {312036#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {312036#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {312036#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {312036#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {312036#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {312036#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {312036#true} [219] L68-2-->L72-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[] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {312036#true} [221] L72-1-->L76-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[] {312036#true} is VALID [2022-04-28 02:02:46,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {312036#true} [223] L76-1-->L80-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[] {312036#true} is VALID [2022-04-28 02:02:46,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {312036#true} [225] L80-1-->L84-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[] {312036#true} is VALID [2022-04-28 02:02:46,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {312036#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {312036#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {312036#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-28 02:02:46,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {312036#true} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {312041#(not (= main_~p9~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {312041#(not (= main_~p9~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {312041#(not (= main_~p9~0 0))} [241] L110-1-->L115-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {312041#(not (= main_~p9~0 0))} [247] L115-1-->L120-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {312041#(not (= main_~p9~0 0))} [251] L120-1-->L125-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {312041#(not (= main_~p9~0 0))} [255] L125-1-->L130-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {312041#(not (= main_~p9~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {312041#(not (= main_~p9~0 0))} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {312041#(not (= main_~p9~0 0))} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-28 02:02:46,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {312041#(not (= main_~p9~0 0))} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {312037#false} is VALID [2022-04-28 02:02:46,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {312037#false} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {312037#false} is VALID [2022-04-28 02:02:46,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {312037#false} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {312037#false} is VALID [2022-04-28 02:02:46,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {312037#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312037#false} is VALID [2022-04-28 02:02:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:02:46,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:46,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843322526] [2022-04-28 02:02:46,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843322526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:46,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:46,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834987728] [2022-04-28 02:02:46,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:02:46,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:46,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:46,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:46,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:46,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:46,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:46,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:46,366 INFO L87 Difference]: Start difference. First operand 14345 states and 16647 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:58,531 INFO L93 Difference]: Finished difference Result 21517 states and 24841 transitions. [2022-04-28 02:02:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:58,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:02:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 02:02:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:02:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 02:02:58,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 02:02:58,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:04,475 INFO L225 Difference]: With dead ends: 21517 [2022-04-28 02:03:04,475 INFO L226 Difference]: Without dead ends: 14603 [2022-04-28 02:03:04,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:03:04,480 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:04,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-28 02:03:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-28 02:03:04,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:04,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:04,684 INFO L74 IsIncluded]: Start isIncluded. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:04,696 INFO L87 Difference]: Start difference. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:10,525 INFO L93 Difference]: Finished difference Result 14603 states and 16648 transitions. [2022-04-28 02:03:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 16648 transitions. [2022-04-28 02:03:10,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:10,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:10,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 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 14603 states. [2022-04-28 02:03:10,555 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 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 14603 states. [2022-04-28 02:03:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:16,449 INFO L93 Difference]: Finished difference Result 14603 states and 16648 transitions. [2022-04-28 02:03:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 16648 transitions. [2022-04-28 02:03:16,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:16,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:16,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:16,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16647 transitions. [2022-04-28 02:03:22,358 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16647 transitions. Word has length 30 [2022-04-28 02:03:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:22,358 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 16647 transitions. [2022-04-28 02:03:22,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16647 transitions. [2022-04-28 02:03:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:03:22,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:22,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:22,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 02:03:22,364 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2032361207, now seen corresponding path program 1 times [2022-04-28 02:03:22,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:22,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448070882] [2022-04-28 02:03:22,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:22,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:22,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:22,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {378672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {378666#true} is VALID [2022-04-28 02:03:22,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {378666#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {378666#true} {378666#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {378666#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:22,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {378672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {378666#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378666#true} {378666#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {378666#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {378666#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {378666#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {378666#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {378666#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {378666#true} [219] L68-2-->L72-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[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {378666#true} [221] L72-1-->L76-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[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {378666#true} [223] L76-1-->L80-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[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {378666#true} [225] L80-1-->L84-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[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {378666#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {378666#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {378666#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {378666#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-28 02:03:22,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {378666#true} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {378671#(= main_~lk10~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {378671#(= main_~lk10~0 1)} [241] L110-1-->L115-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {378671#(= main_~lk10~0 1)} [247] L115-1-->L120-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {378671#(= main_~lk10~0 1)} [251] L120-1-->L125-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {378671#(= main_~lk10~0 1)} [255] L125-1-->L130-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {378671#(= main_~lk10~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {378671#(= main_~lk10~0 1)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {378671#(= main_~lk10~0 1)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {378671#(= main_~lk10~0 1)} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {378671#(= main_~lk10~0 1)} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-28 02:03:22,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {378671#(= main_~lk10~0 1)} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {378667#false} is VALID [2022-04-28 02:03:22,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {378667#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378667#false} is VALID [2022-04-28 02:03:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:03:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:22,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448070882] [2022-04-28 02:03:22,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448070882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:22,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:22,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919833587] [2022-04-28 02:03:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:22,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:03:22,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:22,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:22,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:22,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:22,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:22,427 INFO L87 Difference]: Start difference. First operand 14601 states and 16647 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:36,133 INFO L93 Difference]: Finished difference Result 23563 states and 26632 transitions. [2022-04-28 02:03:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:36,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:03:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 02:03:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 02:03:36,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 02:03:36,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:50,161 INFO L225 Difference]: With dead ends: 23563 [2022-04-28 02:03:50,161 INFO L226 Difference]: Without dead ends: 23561 [2022-04-28 02:03:50,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:03:50,164 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:50,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 68 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23561 states. [2022-04-28 02:03:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23561 to 22537. [2022-04-28 02:03:50,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:50,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:50,461 INFO L74 IsIncluded]: Start isIncluded. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:03:50,482 INFO L87 Difference]: Start difference. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:04:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:04:06,363 INFO L93 Difference]: Finished difference Result 23561 states and 26119 transitions. [2022-04-28 02:04:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 26119 transitions. [2022-04-28 02:04:06,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:04:06,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:04:06,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 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 23561 states. [2022-04-28 02:04:06,420 INFO L87 Difference]: Start difference. First operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 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 23561 states. [2022-04-28 02:04:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:04:20,422 INFO L93 Difference]: Finished difference Result 23561 states and 26119 transitions. [2022-04-28 02:04:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 26119 transitions. [2022-04-28 02:04:20,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:04:20,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:04:20,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:04:20,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:04:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:04:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 25095 transitions. [2022-04-28 02:04:32,231 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 25095 transitions. Word has length 30 [2022-04-28 02:04:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:04:32,232 INFO L495 AbstractCegarLoop]: Abstraction has 22537 states and 25095 transitions. [2022-04-28 02:04:32,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:04:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 25095 transitions. [2022-04-28 02:04:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:04:32,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:04:32,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:04:32,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 02:04:32,245 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:04:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:04:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1969203082, now seen corresponding path program 1 times [2022-04-28 02:04:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:04:32,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601330068] [2022-04-28 02:04:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:04:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:04:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:04:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:04:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:04:32,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {473455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {473449#true} is VALID [2022-04-28 02:04:32,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {473449#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {473449#true} {473449#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {473449#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:04:32,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {473455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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_#length_1| 2) 16) (= (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] {473449#true} is VALID [2022-04-28 02:04:32,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {473449#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {473449#true} {473449#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {473449#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {473449#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {473449#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {473449#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {473449#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {473449#true} [219] L68-2-->L72-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[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {473449#true} [221] L72-1-->L76-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[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {473449#true} [223] L76-1-->L80-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[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {473449#true} [225] L80-1-->L84-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[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {473449#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {473449#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {473449#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {473449#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-28 02:04:32,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {473449#true} [235] L100-1-->L104-1: Formula: (= v_main_~p10~0_5 0) InVars {main_~p10~0=v_main_~p10~0_5} OutVars{main_~p10~0=v_main_~p10~0_5} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {473454#(= main_~p10~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {473454#(= main_~p10~0 0)} [241] L110-1-->L115-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {473454#(= main_~p10~0 0)} [247] L115-1-->L120-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {473454#(= main_~p10~0 0)} [251] L120-1-->L125-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {473454#(= main_~p10~0 0)} [255] L125-1-->L130-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {473454#(= main_~p10~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {473454#(= main_~p10~0 0)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {473454#(= main_~p10~0 0)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {473454#(= main_~p10~0 0)} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-28 02:04:32,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {473454#(= main_~p10~0 0)} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {473450#false} is VALID [2022-04-28 02:04:32,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {473450#false} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {473450#false} is VALID [2022-04-28 02:04:32,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {473450#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473450#false} is VALID [2022-04-28 02:04:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:04:32,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:04:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601330068] [2022-04-28 02:04:32,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601330068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:04:32,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:04:32,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:04:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411636185] [2022-04-28 02:04:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:04:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:04:32,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:04:32,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:04:32,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:04:32,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:04:32,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:04:32,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:04:32,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:04:32,299 INFO L87 Difference]: Start difference. First operand 22537 states and 25095 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:06:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:06:06,858 INFO L93 Difference]: Finished difference Result 50185 states and 54791 transitions. [2022-04-28 02:06:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:06:06,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:06:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:06:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:06:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 02:06:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:06:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 02:06:06,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 02:06:06,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:06:06,943 INFO L225 Difference]: With dead ends: 50185 [2022-04-28 02:06:06,943 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:06:06,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:06:06,974 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:06:06,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 112 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:06:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:06:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:06:06,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:06:06,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:06:06,974 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:06:06,975 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:06:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:06:06,975 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:06:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:06:06,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:06:06,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:06:06,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 02:06:06,975 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 02:06:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:06:06,975 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:06:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:06:06,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:06:06,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:06:06,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:06:06,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:06:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:06:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:06:06,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-28 02:06:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:06:06,976 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:06:06,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:06:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:06:06,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:06:06,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:06:06,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 02:06:06,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:09:17,541 WARN L232 SmtUtils]: Spent 3.18m on a formula simplification that was a NOOP. DAG size: 4152 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 02:09:17,579 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 02:09:17,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:09:17,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:09:17,579 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:09:17,579 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:09:17,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:09:17,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:09:17,579 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 165) the Hoare annotation is: true [2022-04-28 02:09:17,580 INFO L902 garLoopResultBuilder]: At program point L155-1(lines 41 160) the Hoare annotation is: true [2022-04-28 02:09:17,580 INFO L902 garLoopResultBuilder]: At program point L161(lines 7 165) the Hoare annotation is: true [2022-04-28 02:09:17,580 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-04-28 02:09:17,580 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 165) no Hoare annotation was computed. [2022-04-28 02:09:17,580 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2022-04-28 02:09:17,580 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 165) no Hoare annotation was computed. [2022-04-28 02:09:17,580 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L80-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L92-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L96-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L104-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L110-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L895 garLoopResultBuilder]: At program point L156-1(lines 7 165) the Hoare annotation is: false [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-04-28 02:09:17,581 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L120-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L125-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L140-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L150-1(lines 41 160) no Hoare annotation was computed. [2022-04-28 02:09:17,582 INFO L899 garLoopResultBuilder]: For program point L156(line 156) no Hoare annotation was computed. [2022-04-28 02:09:17,584 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:09:17,585 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-28 02:09:17,589 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-04-28 02:09:17,590 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L150-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L150-1 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-28 02:09:17,591 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-28 02:09:17,591 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:09:17,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:09:17 BasicIcfg [2022-04-28 02:09:17,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:09:17,597 INFO L158 Benchmark]: Toolchain (without parser) took 495635.65ms. Allocated memory was 211.8MB in the beginning and 920.6MB in the end (delta: 708.8MB). Free memory was 152.7MB in the beginning and 280.2MB in the end (delta: -127.6MB). Peak memory consumption was 712.6MB. Max. memory is 8.0GB. [2022-04-28 02:09:17,597 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 168.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:09:17,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.25ms. Allocated memory was 211.8MB in the beginning and 306.2MB in the end (delta: 94.4MB). Free memory was 152.4MB in the beginning and 275.4MB in the end (delta: -123.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 02:09:17,599 INFO L158 Benchmark]: Boogie Preprocessor took 44.77ms. Allocated memory is still 306.2MB. Free memory was 275.4MB in the beginning and 273.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:09:17,599 INFO L158 Benchmark]: RCFGBuilder took 368.82ms. Allocated memory is still 306.2MB. Free memory was 273.8MB in the beginning and 258.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-28 02:09:17,599 INFO L158 Benchmark]: IcfgTransformer took 33.44ms. Allocated memory is still 306.2MB. Free memory was 258.1MB in the beginning and 255.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-28 02:09:17,600 INFO L158 Benchmark]: TraceAbstraction took 494956.14ms. Allocated memory was 306.2MB in the beginning and 920.6MB in the end (delta: 614.5MB). Free memory was 255.0MB in the beginning and 280.2MB in the end (delta: -25.3MB). Peak memory consumption was 721.4MB. Max. memory is 8.0GB. [2022-04-28 02:09:17,606 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 211.8MB. Free memory is still 168.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.25ms. Allocated memory was 211.8MB in the beginning and 306.2MB in the end (delta: 94.4MB). Free memory was 152.4MB in the beginning and 275.4MB in the end (delta: -123.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.77ms. Allocated memory is still 306.2MB. Free memory was 275.4MB in the beginning and 273.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 368.82ms. Allocated memory is still 306.2MB. Free memory was 273.8MB in the beginning and 258.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 33.44ms. Allocated memory is still 306.2MB. Free memory was 258.1MB in the beginning and 255.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 494956.14ms. Allocated memory was 306.2MB in the beginning and 920.6MB in the end (delta: 614.5MB). Free memory was 255.0MB in the beginning and 280.2MB in the end (delta: -25.3MB). Peak memory consumption was 721.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 163]: 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 494.9s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 196.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 190.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3720 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3720 mSDsluCounter, 2693 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 2488 mSDtfsCounter, 1747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22537occurred in iteration=28, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 105.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 4126 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 190.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 02:09:17,632 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...