/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/nla-digbench-scaling/hard2_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 01:27:50,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 01:27:50,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 01:27:50,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 01:27:50,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 01:27:50,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 01:27:50,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 01:27:50,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 01:27:50,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 01:27:50,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 01:27:50,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 01:27:50,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 01:27:50,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 01:27:50,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 01:27:50,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 01:27:50,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 01:27:50,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 01:27:50,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 01:27:50,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 01:27:50,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 01:27:50,322 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 01:27:50,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 01:27:50,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 01:27:50,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 01:27:50,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 01:27:50,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 01:27:50,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 01:27:50,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 01:27:50,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 01:27:50,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 01:27:50,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 01:27:50,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 01:27:50,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 01:27:50,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 01:27:50,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 01:27:50,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 01:27:50,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 01:27:50,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 01:27:50,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 01:27:50,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 01:27:50,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 01:27:50,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 01:27:50,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 01:27:50,373 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 01:27:50,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 01:27:50,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 01:27:50,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 01:27:50,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 01:27:50,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 01:27:50,376 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 01:27:50,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 01:27:50,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 01:27:50,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 01:27:50,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 01:27:50,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 01:27:50,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 01:27:50,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 01:27:50,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 01:27:50,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 01:27:50,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 01:27:50,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 01:27:50,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 01:27:50,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:27:50,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 01:27:50,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 01:27:50,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 01:27:50,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 01:27:50,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 01:27:50,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 01:27:50,380 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 01:27:50,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 01:27:50,382 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 01:27:50,382 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 01:27:50,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 01:27:50,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 01:27:50,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 01:27:50,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 01:27:50,667 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 01:27:50,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound1.c [2022-04-08 01:27:50,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f8fa904/bee76be269b14a05ad82b3b47c1f3890/FLAG2b9241725 [2022-04-08 01:27:51,248 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 01:27:51,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound1.c [2022-04-08 01:27:51,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f8fa904/bee76be269b14a05ad82b3b47c1f3890/FLAG2b9241725 [2022-04-08 01:27:51,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f8fa904/bee76be269b14a05ad82b3b47c1f3890 [2022-04-08 01:27:51,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 01:27:51,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 01:27:51,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 01:27:51,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 01:27:51,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 01:27:51,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dff192e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51, skipping insertion in model container [2022-04-08 01:27:51,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 01:27:51,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 01:27:51,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound1.c[526,539] [2022-04-08 01:27:51,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:27:51,869 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 01:27:51,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound1.c[526,539] [2022-04-08 01:27:51,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:27:51,904 INFO L208 MainTranslator]: Completed translation [2022-04-08 01:27:51,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51 WrapperNode [2022-04-08 01:27:51,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 01:27:51,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 01:27:51,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 01:27:51,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 01:27:51,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 01:27:51,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 01:27:51,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 01:27:51,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 01:27:51,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (1/1) ... [2022-04-08 01:27:51,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:27:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:27:51,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 01:27:52,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 01:27:52,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 01:27:52,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 01:27:52,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 01:27:52,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 01:27:52,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 01:27:52,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 01:27:52,023 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 01:27:52,023 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 01:27:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 01:27:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 01:27:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 01:27:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 01:27:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 01:27:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 01:27:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 01:27:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 01:27:52,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 01:27:52,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 01:27:52,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 01:27:52,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 01:27:52,091 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 01:27:52,093 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 01:27:52,333 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 01:27:52,339 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 01:27:52,340 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 01:27:52,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:27:52 BoogieIcfgContainer [2022-04-08 01:27:52,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 01:27:52,342 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 01:27:52,343 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 01:27:52,356 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 01:27:52,359 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:27:52" (1/1) ... [2022-04-08 01:27:52,361 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 01:27:52,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:27:52 BasicIcfg [2022-04-08 01:27:52,413 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 01:27:52,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 01:27:52,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 01:27:52,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 01:27:52,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:27:51" (1/4) ... [2022-04-08 01:27:52,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1022728f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:27:52, skipping insertion in model container [2022-04-08 01:27:52,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:27:51" (2/4) ... [2022-04-08 01:27:52,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1022728f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:27:52, skipping insertion in model container [2022-04-08 01:27:52,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:27:52" (3/4) ... [2022-04-08 01:27:52,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1022728f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:27:52, skipping insertion in model container [2022-04-08 01:27:52,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:27:52" (4/4) ... [2022-04-08 01:27:52,422 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound1.cqvasr [2022-04-08 01:27:52,427 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 01:27:52,427 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 01:27:52,481 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 01:27:52,495 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 01:27:52,495 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 01:27:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 01:27:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 01:27:52,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:27:52,523 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:27:52,524 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:27:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:27:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash 121155216, now seen corresponding path program 1 times [2022-04-08 01:27:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:27:52,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133179731] [2022-04-08 01:27:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:27:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:27:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:52,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-08 01:27:52,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 01:27:52,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 01:27:52,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:27:52,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-08 01:27:52,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 01:27:52,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 01:27:52,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-08 01:27:52,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {34#true} is VALID [2022-04-08 01:27:52,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [101] L34-3-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 01:27:52,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} [103] L52-2-->L44-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 01:27:52,792 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {35#false} is VALID [2022-04-08 01:27:52,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-08 01:27:52,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 01:27:52,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-08 01:27:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 01:27:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:27:52,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133179731] [2022-04-08 01:27:52,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133179731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:27:52,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:27:52,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 01:27:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347045490] [2022-04-08 01:27:52,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:27:52,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 01:27:52,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:27:52,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:52,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:52,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 01:27:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:27:52,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 01:27:52,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 01:27:52,871 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:53,109 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-08 01:27:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 01:27:53,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 01:27:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:27:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 01:27:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 01:27:53,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-08 01:27:53,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:53,268 INFO L225 Difference]: With dead ends: 57 [2022-04-08 01:27:53,269 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 01:27:53,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 01:27:53,290 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:27:53,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 01:27:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 01:27:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 01:27:53,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:27:53,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:53,325 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:53,325 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:53,329 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 01:27:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 01:27:53,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:53,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:53,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-08 01:27:53,331 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-08 01:27:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:53,337 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 01:27:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 01:27:53,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:53,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:53,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:27:53,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:27:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-08 01:27:53,343 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-08 01:27:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:27:53,343 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-08 01:27:53,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-08 01:27:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 01:27:53,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:27:53,344 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:27:53,345 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 01:27:53,345 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:27:53,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:27:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash 152644303, now seen corresponding path program 1 times [2022-04-08 01:27:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:27:53,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338795671] [2022-04-08 01:27:53,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:53,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:27:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:27:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:53,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {215#true} is VALID [2022-04-08 01:27:53,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-08 01:27:53,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-08 01:27:53,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:27:53,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {215#true} is VALID [2022-04-08 01:27:53,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-08 01:27:53,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-08 01:27:53,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-08 01:27:53,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {220#(= main_~q~0 0)} is VALID [2022-04-08 01:27:53,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~q~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {220#(= main_~q~0 0)} is VALID [2022-04-08 01:27:53,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~q~0 0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {220#(= main_~q~0 0)} is VALID [2022-04-08 01:27:53,509 INFO L272 TraceCheckUtils]: 8: Hoare triple {220#(= main_~q~0 0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {221#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:27:53,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {222#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:27:53,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(not (= __VERIFIER_assert_~cond 0))} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-08 01:27:53,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-08 01:27:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 01:27:53,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:27:53,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338795671] [2022-04-08 01:27:53,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338795671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:27:53,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:27:53,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 01:27:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359760534] [2022-04-08 01:27:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:27:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 01:27:53,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:27:53,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:53,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:53,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:27:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:27:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:27:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:27:53,531 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:53,898 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-08 01:27:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 01:27:53,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 01:27:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:27:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 01:27:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 01:27:53,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 01:27:53,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:54,001 INFO L225 Difference]: With dead ends: 41 [2022-04-08 01:27:54,001 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 01:27:54,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 01:27:54,009 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:27:54,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 01:27:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 01:27:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-08 01:27:54,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:27:54,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:54,017 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:54,017 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:54,021 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 01:27:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 01:27:54,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:54,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:54,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 01:27:54,023 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 01:27:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:54,026 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 01:27:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 01:27:54,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:54,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:54,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:27:54,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:27:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-08 01:27:54,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-08 01:27:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:27:54,030 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-08 01:27:54,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-08 01:27:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 01:27:54,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:27:54,031 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:27:54,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 01:27:54,032 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:27:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:27:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash -400958603, now seen corresponding path program 1 times [2022-04-08 01:27:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:27:54,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485452154] [2022-04-08 01:27:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:27:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:27:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:54,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {421#(<= ~counter~0 0)} is VALID [2022-04-08 01:27:54,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-08 01:27:54,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-08 01:27:54,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:27:54,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {421#(<= ~counter~0 0)} is VALID [2022-04-08 01:27:54,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~counter~0 0)} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-08 01:27:54,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-08 01:27:54,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(<= ~counter~0 0)} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(<= ~counter~0 0)} is VALID [2022-04-08 01:27:54,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#(<= ~counter~0 0)} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {421#(<= ~counter~0 0)} is VALID [2022-04-08 01:27:54,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(<= ~counter~0 0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {422#(<= |main_#t~post5| 0)} is VALID [2022-04-08 01:27:54,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(<= |main_#t~post5| 0)} [105] L34-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 1)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {417#false} is VALID [2022-04-08 01:27:54,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#false} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {417#false} is VALID [2022-04-08 01:27:54,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#false} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {417#false} is VALID [2022-04-08 01:27:54,117 INFO L272 TraceCheckUtils]: 10: Hoare triple {417#false} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {417#false} is VALID [2022-04-08 01:27:54,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {417#false} is VALID [2022-04-08 01:27:54,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-08 01:27:54,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-08 01:27:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 01:27:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:27:54,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485452154] [2022-04-08 01:27:54,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485452154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:27:54,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:27:54,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 01:27:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452774062] [2022-04-08 01:27:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:27:54,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 01:27:54,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:27:54,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:54,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:54,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:27:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:27:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:27:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:27:54,139 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:54,371 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-08 01:27:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 01:27:54,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 01:27:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:27:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 01:27:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 01:27:54,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-08 01:27:54,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:54,429 INFO L225 Difference]: With dead ends: 46 [2022-04-08 01:27:54,430 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 01:27:54,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:27:54,431 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:27:54,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 01:27:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 01:27:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 01:27:54,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:27:54,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:54,439 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:54,440 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:54,442 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 01:27:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 01:27:54,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:54,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:54,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-08 01:27:54,444 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-08 01:27:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:54,446 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 01:27:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 01:27:54,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:54,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:54,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:27:54,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:27:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 01:27:54,450 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-08 01:27:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:27:54,450 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 01:27:54,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 01:27:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 01:27:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 01:27:54,451 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:27:54,451 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:27:54,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 01:27:54,452 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:27:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:27:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 185978583, now seen corresponding path program 1 times [2022-04-08 01:27:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:27:54,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273158819] [2022-04-08 01:27:54,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:27:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:54,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:27:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:54,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {605#true} is VALID [2022-04-08 01:27:54,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-08 01:27:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:54,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {605#true} is VALID [2022-04-08 01:27:54,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:27:54,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:27:54,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {605#true} is VALID [2022-04-08 01:27:54,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:27:54,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(= main_~A~0 main_~r~0)} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:27:54,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(= main_~A~0 main_~r~0)} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:27:54,564 INFO L272 TraceCheckUtils]: 8: Hoare triple {610#(= main_~A~0 main_~r~0)} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {605#true} is VALID [2022-04-08 01:27:54,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {605#true} is VALID [2022-04-08 01:27:54,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#true} is VALID [2022-04-08 01:27:54,567 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 01:27:54,567 INFO L272 TraceCheckUtils]: 13: Hoare triple {610#(= main_~A~0 main_~r~0)} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {615#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:27:54,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {616#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:27:54,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#(not (= __VERIFIER_assert_~cond 0))} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {606#false} is VALID [2022-04-08 01:27:54,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {606#false} is VALID [2022-04-08 01:27:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 01:27:54,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:27:54,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273158819] [2022-04-08 01:27:54,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273158819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:27:54,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:27:54,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 01:27:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779205517] [2022-04-08 01:27:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:27:54,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 01:27:54,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:27:54,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 01:27:54,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:54,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 01:27:54,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:27:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 01:27:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:27:54,591 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 01:27:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:54,954 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 01:27:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 01:27:54,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 01:27:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:27:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 01:27:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 01:27:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 01:27:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 01:27:54,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 01:27:55,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:55,012 INFO L225 Difference]: With dead ends: 46 [2022-04-08 01:27:55,012 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 01:27:55,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 01:27:55,013 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:27:55,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 01:27:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 01:27:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-08 01:27:55,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:27:55,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:55,022 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:55,022 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:55,040 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 01:27:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 01:27:55,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:55,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:55,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 01:27:55,042 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 01:27:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:55,045 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 01:27:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 01:27:55,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:55,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:55,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:27:55,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:27:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 01:27:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-08 01:27:55,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-08 01:27:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:27:55,048 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-08 01:27:55,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 01:27:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-08 01:27:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 01:27:55,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:27:55,050 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:27:55,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 01:27:55,050 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:27:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:27:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash -820589269, now seen corresponding path program 1 times [2022-04-08 01:27:55,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:27:55,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177537984] [2022-04-08 01:27:55,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:27:55,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:27:55,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173331332] [2022-04-08 01:27:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:55,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:27:55,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:27:55,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 01:27:55,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 01:27:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:55,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 01:27:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:55,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:27:55,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-08 01:27:55,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {834#true} is VALID [2022-04-08 01:27:55,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-08 01:27:55,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-08 01:27:55,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-08 01:27:55,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:27:55,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:27:55,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:27:55,459 INFO L272 TraceCheckUtils]: 8: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {834#true} is VALID [2022-04-08 01:27:55,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {834#true} is VALID [2022-04-08 01:27:55,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-08 01:27:55,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-08 01:27:55,461 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:27:55,461 INFO L272 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {834#true} is VALID [2022-04-08 01:27:55,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {834#true} is VALID [2022-04-08 01:27:55,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-08 01:27:55,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {834#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#true} is VALID [2022-04-08 01:27:55,462 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 01:27:55,463 INFO L272 TraceCheckUtils]: 18: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:27:55,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:27:55,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {835#false} is VALID [2022-04-08 01:27:55,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#false} is VALID [2022-04-08 01:27:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 01:27:55,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:27:55,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:27:55,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177537984] [2022-04-08 01:27:55,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:27:55,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173331332] [2022-04-08 01:27:55,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173331332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:27:55,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:27:55,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 01:27:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773578564] [2022-04-08 01:27:55,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:27:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 01:27:55,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:27:55,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:27:55,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:55,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:27:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:27:55,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:27:55,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:27:55,489 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:27:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:55,670 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-08 01:27:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:27:55,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 01:27:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:27:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:27:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 01:27:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:27:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 01:27:55,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-08 01:27:55,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:55,751 INFO L225 Difference]: With dead ends: 65 [2022-04-08 01:27:55,751 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 01:27:55,752 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:27:55,753 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:27:55,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:27:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 01:27:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 01:27:55,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:27:55,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 01:27:55,763 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 01:27:55,763 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 01:27:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:55,766 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 01:27:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 01:27:55,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:55,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:55,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-08 01:27:55,768 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-08 01:27:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:55,771 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 01:27:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 01:27:55,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:55,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:55,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:27:55,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:27:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 01:27:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 01:27:55,775 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-08 01:27:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:27:55,775 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-08 01:27:55,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:27:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 01:27:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 01:27:55,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:27:55,776 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:27:55,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 01:27:55,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:27:56,000 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:27:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:27:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1259710898, now seen corresponding path program 1 times [2022-04-08 01:27:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:27:56,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290355255] [2022-04-08 01:27:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:27:56,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:27:56,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553772751] [2022-04-08 01:27:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:56,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:27:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:27:56,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 01:27:56,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 01:27:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:56,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 01:27:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:27:56,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:27:56,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [97] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1173#true} is VALID [2022-04-08 01:27:56,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} [130] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} [99] mainENTRY-->L34-3: Formula: (and (= v_main_~B~0_2 1) (= v_main_~B~0_2 v_main_~d~0_1) (= v_main_~q~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p~0_1 1) (= v_main_~A~0_2 |v_main_#t~nondet4_2|) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [102] L34-3-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [106] L34-1-->L35: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,311 INFO L272 TraceCheckUtils]: 8: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [110] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1173#true} is VALID [2022-04-08 01:27:56,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-08 01:27:56,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {1173#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {1173#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,316 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1173#true} {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [132] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~q~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,316 INFO L272 TraceCheckUtils]: 13: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [114] L35-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1173#true} is VALID [2022-04-08 01:27:56,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {1173#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-08 01:27:56,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,318 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1173#true} {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [133] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~r~0_12 v_main_~A~0_7) 1 0)) InVars {main_~A~0=v_main_~A~0_7, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,318 INFO L272 TraceCheckUtils]: 18: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [119] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1173#true} is VALID [2022-04-08 01:27:56,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {1173#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-08 01:27:56,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1173#true} [117] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1173#true} [123] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-08 01:27:56,320 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1173#true} {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [134] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~p~0_12 v_main_~B~0_8) v_main_~d~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_8, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [126] L37-->L52-2: Formula: (not (<= v_main_~d~0_11 v_main_~r~0_10)) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [104] L52-2-->L44: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [108] L44-->L44-2: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 01:27:56,323 INFO L272 TraceCheckUtils]: 26: Hoare triple {1193#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [107] L44-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~A~0_9 (+ v_main_~r~0_14 (* v_main_~q~0_11 v_main_~d~0_17))) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_11, main_~d~0=v_main_~d~0_17, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:27:56,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:27:56,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {1261#(<= 1 __VERIFIER_assert_~cond)} [116] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-08 01:27:56,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {1174#false} [121] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-08 01:27:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 01:27:56,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:27:56,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:27:56,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290355255] [2022-04-08 01:27:56,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:27:56,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553772751] [2022-04-08 01:27:56,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553772751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:27:56,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:27:56,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 01:27:56,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318904847] [2022-04-08 01:27:56,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:27:56,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 01:27:56,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:27:56,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:27:56,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:56,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:27:56,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:27:56,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:27:56,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:27:56,349 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:27:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:56,512 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-08 01:27:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:27:56,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 01:27:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:27:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:27:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 01:27:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:27:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 01:27:56,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-08 01:27:56,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:27:56,563 INFO L225 Difference]: With dead ends: 64 [2022-04-08 01:27:56,564 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 01:27:56,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:27:56,565 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:27:56,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:27:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 01:27:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-08 01:27:56,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:27:56,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 01:27:56,576 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 01:27:56,577 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 01:27:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:56,579 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-08 01:27:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 01:27:56,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:56,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:56,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-08 01:27:56,581 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-08 01:27:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:27:56,584 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-08 01:27:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 01:27:56,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:27:56,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:27:56,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:27:56,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:27:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 01:27:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-04-08 01:27:56,587 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 30 [2022-04-08 01:27:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:27:56,588 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-04-08 01:27:56,588 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 01:27:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-08 01:27:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 01:27:56,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:27:56,589 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:27:56,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 01:27:56,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 01:27:56,816 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:27:56,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:27:56,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1811137592, now seen corresponding path program 1 times [2022-04-08 01:27:56,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:27:56,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081188507] [2022-04-08 01:27:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:56,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:27:56,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:27:56,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259584488] [2022-04-08 01:27:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:27:56,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:27:56,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:27:56,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 01:27:56,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 01:27:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 01:27:56,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 01:27:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 01:27:56,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 01:27:56,948 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 01:27:56,949 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 01:27:56,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 01:27:57,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:27:57,179 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:27:57,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 01:27:57,241 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 01:27:57,242 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-08 01:27:57,243 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-08 01:27:57,243 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-08 01:27:57,243 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-08 01:27:57,243 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-08 01:27:57,243 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 01:27:57,243 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 01:27:57,259 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 01:27:57,259 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 01:27:57,259 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 01:27:57,259 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 01:27:57,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:27:57 BasicIcfg [2022-04-08 01:27:57,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 01:27:57,262 INFO L158 Benchmark]: Toolchain (without parser) took 5640.22ms. Allocated memory was 197.1MB in the beginning and 245.4MB in the end (delta: 48.2MB). Free memory was 148.8MB in the beginning and 117.2MB in the end (delta: 31.6MB). Peak memory consumption was 80.5MB. Max. memory is 8.0GB. [2022-04-08 01:27:57,263 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 197.1MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 01:27:57,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.15ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 174.7MB in the end (delta: -26.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 01:27:57,263 INFO L158 Benchmark]: Boogie Preprocessor took 32.22ms. Allocated memory is still 197.1MB. Free memory was 174.7MB in the beginning and 173.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 01:27:57,263 INFO L158 Benchmark]: RCFGBuilder took 403.02ms. Allocated memory is still 197.1MB. Free memory was 173.2MB in the beginning and 161.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 01:27:57,264 INFO L158 Benchmark]: IcfgTransformer took 70.69ms. Allocated memory is still 197.1MB. Free memory was 161.2MB in the beginning and 159.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 01:27:57,264 INFO L158 Benchmark]: TraceAbstraction took 4846.02ms. Allocated memory was 197.1MB in the beginning and 245.4MB in the end (delta: 48.2MB). Free memory was 159.1MB in the beginning and 117.2MB in the end (delta: 41.9MB). Peak memory consumption was 90.5MB. Max. memory is 8.0GB. [2022-04-08 01:27:57,266 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.17ms. Allocated memory is still 197.1MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.15ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 174.7MB in the end (delta: -26.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.22ms. Allocated memory is still 197.1MB. Free memory was 174.7MB in the beginning and 173.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 403.02ms. Allocated memory is still 197.1MB. Free memory was 173.2MB in the beginning and 161.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 70.69ms. Allocated memory is still 197.1MB. Free memory was 161.2MB in the beginning and 159.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4846.02ms. Allocated memory was 197.1MB in the beginning and 245.4MB in the end (delta: 48.2MB). Free memory was 159.1MB in the beginning and 117.2MB in the end (delta: 41.9MB). Peak memory consumption was 90.5MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=6, counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [\old(counter)=0, A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=1, counter++=0, d=1, p=1, q=0, r=1] [L34] COND TRUE counter++<1 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=2, counter++=1, d=2, p=2, q=0, r=1] [L34] COND FALSE !(counter++<1) [L44] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=3, counter++=2, d=2, p=2, q=0, r=1] [L44] COND FALSE !(counter++<1) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L58] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L59] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 496 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 287 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 340 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 209 mSDtfsCounter, 340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 282 SizeOfPredicates, 2 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-08 01:27:57,335 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...