/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/geo1-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 00:12:09,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 00:12:09,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 00:12:09,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 00:12:09,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 00:12:09,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 00:12:09,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 00:12:09,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 00:12:09,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 00:12:09,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 00:12:09,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 00:12:09,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 00:12:09,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 00:12:09,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 00:12:09,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 00:12:09,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 00:12:09,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 00:12:09,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 00:12:09,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 00:12:09,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 00:12:09,292 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 00:12:09,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 00:12:09,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 00:12:09,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 00:12:09,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 00:12:09,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 00:12:09,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 00:12:09,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 00:12:09,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 00:12:09,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 00:12:09,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 00:12:09,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 00:12:09,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 00:12:09,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 00:12:09,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 00:12:09,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 00:12:09,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 00:12:09,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 00:12:09,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 00:12:09,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 00:12:09,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 00:12:09,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 00:12:09,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 00:12:09,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 00:12:09,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 00:12:09,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 00:12:09,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 00:12:09,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 00:12:09,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 00:12:09,341 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 00:12:09,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 00:12:09,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 00:12:09,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 00:12:09,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 00:12:09,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 00:12:09,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 00:12:09,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 00:12:09,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 00:12:09,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 00:12:09,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 00:12:09,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 00:12:09,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 00:12:09,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:12:09,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 00:12:09,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 00:12:09,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 00:12:09,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 00:12:09,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 00:12:09,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 00:12:09,344 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 00:12:09,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 00:12:09,345 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 00:12:09,345 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 00:12:09,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 00:12:09,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 00:12:09,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 00:12:09,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 00:12:09,619 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 00:12:09,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound2.c [2022-04-28 00:12:09,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad41a796c/6392c89b8e984acf8dc471db6f03fc19/FLAGc352a0ebe [2022-04-28 00:12:09,994 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 00:12:09,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound2.c [2022-04-28 00:12:10,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad41a796c/6392c89b8e984acf8dc471db6f03fc19/FLAGc352a0ebe [2022-04-28 00:12:10,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad41a796c/6392c89b8e984acf8dc471db6f03fc19 [2022-04-28 00:12:10,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 00:12:10,437 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 00:12:10,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 00:12:10,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 00:12:10,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 00:12:10,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101df8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10, skipping insertion in model container [2022-04-28 00:12:10,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 00:12:10,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 00:12:10,615 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/geo1-u_unwindbound2.c[555,568] [2022-04-28 00:12:10,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:12:10,635 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 00:12:10,646 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/geo1-u_unwindbound2.c[555,568] [2022-04-28 00:12:10,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:12:10,661 INFO L208 MainTranslator]: Completed translation [2022-04-28 00:12:10,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10 WrapperNode [2022-04-28 00:12:10,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 00:12:10,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 00:12:10,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 00:12:10,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 00:12:10,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 00:12:10,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 00:12:10,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 00:12:10,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 00:12:10,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:12:10,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:12:10,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 00:12:10,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 00:12:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 00:12:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 00:12:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 00:12:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 00:12:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 00:12:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 00:12:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 00:12:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 00:12:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 00:12:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 00:12:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 00:12:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 00:12:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 00:12:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 00:12:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 00:12:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 00:12:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 00:12:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 00:12:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 00:12:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 00:12:10,836 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 00:12:10,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 00:12:10,937 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 00:12:10,968 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 00:12:10,968 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 00:12:10,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:12:10 BoogieIcfgContainer [2022-04-28 00:12:10,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 00:12:10,971 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 00:12:10,971 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 00:12:10,972 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 00:12:10,974 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:12:10" (1/1) ... [2022-04-28 00:12:10,976 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 00:12:11,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:12:11 BasicIcfg [2022-04-28 00:12:11,020 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 00:12:11,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 00:12:11,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 00:12:11,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 00:12:11,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:12:10" (1/4) ... [2022-04-28 00:12:11,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:12:11, skipping insertion in model container [2022-04-28 00:12:11,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:10" (2/4) ... [2022-04-28 00:12:11,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:12:11, skipping insertion in model container [2022-04-28 00:12:11,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:12:10" (3/4) ... [2022-04-28 00:12:11,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:12:11, skipping insertion in model container [2022-04-28 00:12:11,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:12:11" (4/4) ... [2022-04-28 00:12:11,030 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_unwindbound2.cqvasr [2022-04-28 00:12:11,045 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 00:12:11,045 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 00:12:11,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 00:12:11,092 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f5f6dd7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@582319bb [2022-04-28 00:12:11,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 00:12:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 00:12:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 00:12:11,105 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:12:11,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:12:11,106 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:12:11,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:12:11,110 INFO L85 PathProgramCache]: Analyzing trace with hash -877218113, now seen corresponding path program 1 times [2022-04-28 00:12:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:12:11,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516401288] [2022-04-28 00:12:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:11,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:12:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:12:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:11,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {26#true} is VALID [2022-04-28 00:12:11,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 00:12:11,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 00:12:11,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:12:11,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {26#true} is VALID [2022-04-28 00:12:11,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 00:12:11,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 00:12:11,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 00:12:11,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [62] mainENTRY-->L33-3: Formula: (and (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (= v_main_~c~0_2 1) (= (mod v_main_~z~0_2 4294967296) v_main_~y~0_2) (= v_main_~x~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {26#true} is VALID [2022-04-28 00:12:11,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [64] L33-3-->L33-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-28 00:12:11,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} [66] L33-4-->L47: Formula: (= (* v_main_~x~0_8 (mod (+ v_main_~z~0_6 4294967295) 4294967296)) v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0] {27#false} is VALID [2022-04-28 00:12:11,286 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} [69] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~x~0_11 (* (- 1) v_main_~y~0_9) 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {27#false} is VALID [2022-04-28 00:12:11,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [72] __VERIFIER_assertENTRY-->L16: 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] {27#false} is VALID [2022-04-28 00:12:11,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [76] L16-->L17: 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[] {27#false} is VALID [2022-04-28 00:12:11,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} [78] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-28 00:12:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:12:11,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:12:11,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516401288] [2022-04-28 00:12:11,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516401288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:12:11,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:12:11,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 00:12:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100741350] [2022-04-28 00:12:11,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:12:11,296 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-28 00:12:11,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:12:11,300 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-28 00:12:11,317 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-28 00:12:11,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 00:12:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:12:11,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 00:12:11,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 00:12:11,337 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-28 00:12:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:11,424 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-28 00:12:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 00:12:11,425 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-28 00:12:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:12:11,426 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-28 00:12:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 00:12:11,433 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-28 00:12:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 00:12:11,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-28 00:12:11,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:12:11,501 INFO L225 Difference]: With dead ends: 41 [2022-04-28 00:12:11,501 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 00:12:11,503 INFO L412 NwaCegarLoop]: 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-28 00:12:11,506 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:12:11,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:12:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 00:12:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 00:12:11,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:12:11,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:12:11,531 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:12:11,531 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:12:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:11,534 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 00:12:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 00:12:11,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:11,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:11,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 00:12:11,536 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 00:12:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:11,539 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 00:12:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 00:12:11,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:11,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:11,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:12:11,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:12:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 00:12:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 00:12:11,545 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-28 00:12:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:12:11,545 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 00:12:11,545 INFO L496 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-28 00:12:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 00:12:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 00:12:11,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:12:11,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:12:11,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 00:12:11,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:12:11,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:12:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -846712129, now seen corresponding path program 1 times [2022-04-28 00:12:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:12:11,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201165384] [2022-04-28 00:12:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:12:11,584 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:12:11,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114132119] [2022-04-28 00:12:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:12:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:12:11,587 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-28 00:12:11,588 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-28 00:12:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:11,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:12:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:11,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:12:11,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-28 00:12:11,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {152#true} is VALID [2022-04-28 00:12:11,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-28 00:12:11,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-28 00:12:11,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-28 00:12:11,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} [62] mainENTRY-->L33-3: Formula: (and (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (= v_main_~c~0_2 1) (= (mod v_main_~z~0_2 4294967296) v_main_~y~0_2) (= v_main_~x~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 00:12:11,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} [65] L33-3-->L33-1: Formula: (and (= |v_main_#t~post6_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 00:12:11,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} [68] L33-1-->L34: Formula: (< |v_main_#t~post6_4| 2) InVars {main_#t~post6=|v_main_#t~post6_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 00:12:11,838 INFO L272 TraceCheckUtils]: 8: Hoare triple {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} [70] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* (- 1) v_main_~x~0_10) (* v_main_~x~0_10 (mod v_main_~z~0_7 4294967296)) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:12:11,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L16: 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] {186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:12:11,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(<= 1 __VERIFIER_assert_~cond)} [76] L16-->L17: 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[] {153#false} is VALID [2022-04-28 00:12:11,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#false} [78] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#false} is VALID [2022-04-28 00:12:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:12:11,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:12:11,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:12:11,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201165384] [2022-04-28 00:12:11,841 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:12:11,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114132119] [2022-04-28 00:12:11,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114132119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:12:11,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:12:11,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 00:12:11,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792541024] [2022-04-28 00:12:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:12:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-28 00:12:11,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:12:11,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-28 00:12:11,866 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-28 00:12:11,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:12:11,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:12:11,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:12:11,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:12:11,868 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-28 00:12:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:12,000 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 00:12:12,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:12:12,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-28 00:12:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:12:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-28 00:12:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-28 00:12:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-28 00:12:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-28 00:12:12,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-28 00:12:12,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:12:12,053 INFO L225 Difference]: With dead ends: 29 [2022-04-28 00:12:12,053 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 00:12:12,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-28 00:12:12,056 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:12:12,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:12:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 00:12:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-28 00:12:12,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:12:12,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 00:12:12,069 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 00:12:12,069 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 00:12:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:12,072 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 00:12:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 00:12:12,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:12,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:12,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 00:12:12,074 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 00:12:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:12,077 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 00:12:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 00:12:12,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:12,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:12,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:12:12,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:12:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 00:12:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 00:12:12,085 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 12 [2022-04-28 00:12:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:12:12,085 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 00:12:12,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-28 00:12:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 00:12:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 00:12:12,087 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:12:12,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:12:12,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 00:12:12,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:12:12,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:12:12,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:12:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash -510688659, now seen corresponding path program 1 times [2022-04-28 00:12:12,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:12:12,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350345214] [2022-04-28 00:12:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:12,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:12:12,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:12:12,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307025774] [2022-04-28 00:12:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:12,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:12:12,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:12:12,311 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-28 00:12:12,316 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-28 00:12:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:12,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 00:12:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:12,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:12:12,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {324#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {324#true} is VALID [2022-04-28 00:12:12,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {324#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #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] {332#(<= ~counter~0 0)} is VALID [2022-04-28 00:12:12,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#(<= ~counter~0 0)} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#(<= ~counter~0 0)} is VALID [2022-04-28 00:12:12,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#(<= ~counter~0 0)} {324#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#(<= ~counter~0 0)} is VALID [2022-04-28 00:12:12,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {332#(<= ~counter~0 0)} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#(<= ~counter~0 0)} is VALID [2022-04-28 00:12:12,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#(<= ~counter~0 0)} [62] mainENTRY-->L33-3: Formula: (and (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (= v_main_~c~0_2 1) (= (mod v_main_~z~0_2 4294967296) v_main_~y~0_2) (= v_main_~x~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {332#(<= ~counter~0 0)} is VALID [2022-04-28 00:12:12,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(<= ~counter~0 0)} [65] L33-3-->L33-1: Formula: (and (= |v_main_#t~post6_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {348#(<= |main_#t~post6| 0)} is VALID [2022-04-28 00:12:12,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(<= |main_#t~post6| 0)} [67] L33-1-->L33-4: Formula: (not (< |v_main_#t~post6_2| 2)) InVars {main_#t~post6=|v_main_#t~post6_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {325#false} is VALID [2022-04-28 00:12:12,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {325#false} [66] L33-4-->L47: Formula: (= (* v_main_~x~0_8 (mod (+ v_main_~z~0_6 4294967295) 4294967296)) v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0] {325#false} is VALID [2022-04-28 00:12:12,488 INFO L272 TraceCheckUtils]: 9: Hoare triple {325#false} [69] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~x~0_11 (* (- 1) v_main_~y~0_9) 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {325#false} is VALID [2022-04-28 00:12:12,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {325#false} [72] __VERIFIER_assertENTRY-->L16: 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] {325#false} is VALID [2022-04-28 00:12:12,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#false} [76] L16-->L17: 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[] {325#false} is VALID [2022-04-28 00:12:12,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {325#false} [78] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#false} is VALID [2022-04-28 00:12:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:12:12,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:12:12,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:12:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350345214] [2022-04-28 00:12:12,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:12:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307025774] [2022-04-28 00:12:12,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307025774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:12:12,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:12:12,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 00:12:12,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274941701] [2022-04-28 00:12:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:12:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-28 00:12:12,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:12:12,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 00:12:12,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:12:12,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 00:12:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:12:12,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 00:12:12,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 00:12:12,504 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 00:12:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:12,550 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 00:12:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 00:12:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-28 00:12:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:12:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 00:12:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 00:12:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 00:12:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 00:12:12,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-28 00:12:12,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:12:12,585 INFO L225 Difference]: With dead ends: 33 [2022-04-28 00:12:12,585 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 00:12:12,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 00:12:12,586 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:12:12,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:12:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 00:12:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 00:12:12,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:12:12,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 00:12:12,593 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 00:12:12,593 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 00:12:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:12,595 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 00:12:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 00:12:12,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:12,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:12,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 00:12:12,596 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 00:12:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:12,598 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 00:12:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 00:12:12,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:12,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:12,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:12:12,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:12:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 00:12:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 00:12:12,600 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2022-04-28 00:12:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:12:12,600 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 00:12:12,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 00:12:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 00:12:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 00:12:12,601 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:12:12,602 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:12:12,629 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-28 00:12:12,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 00:12:12,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:12:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:12:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash -264482511, now seen corresponding path program 1 times [2022-04-28 00:12:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:12:12,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137125826] [2022-04-28 00:12:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:12:12,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:12:12,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788555547] [2022-04-28 00:12:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:12,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:12:12,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:12:12,832 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-28 00:12:12,853 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-28 00:12:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 00:12:12,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 00:12:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 00:12:12,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 00:12:12,894 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 00:12:12,895 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 00:12:12,933 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-28 00:12:13,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:12:13,118 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-28 00:12:13,121 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 00:12:13,149 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 00:12:13,149 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 00:12:13,149 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 00:12:13,149 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 00:12:13,149 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 00:12:13,149 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 00:12:13,149 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:12:13,150 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:12:13,151 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 00:12:13,151 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 00:12:13,151 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-28 00:12:13,151 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 00:12:13,151 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 00:12:13,151 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 00:12:13,151 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-28 00:12:13,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:12:13 BasicIcfg [2022-04-28 00:12:13,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 00:12:13,153 INFO L158 Benchmark]: Toolchain (without parser) took 2715.50ms. Allocated memory was 174.1MB in the beginning and 275.8MB in the end (delta: 101.7MB). Free memory was 118.3MB in the beginning and 208.6MB in the end (delta: -90.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-28 00:12:13,153 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 00:12:13,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.67ms. Allocated memory was 174.1MB in the beginning and 275.8MB in the end (delta: 101.7MB). Free memory was 118.2MB in the beginning and 249.2MB in the end (delta: -131.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-28 00:12:13,154 INFO L158 Benchmark]: Boogie Preprocessor took 28.31ms. Allocated memory is still 275.8MB. Free memory was 249.2MB in the beginning and 247.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 00:12:13,154 INFO L158 Benchmark]: RCFGBuilder took 278.12ms. Allocated memory is still 275.8MB. Free memory was 247.5MB in the beginning and 236.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 00:12:13,154 INFO L158 Benchmark]: IcfgTransformer took 48.69ms. Allocated memory is still 275.8MB. Free memory was 236.7MB in the beginning and 235.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 00:12:13,155 INFO L158 Benchmark]: TraceAbstraction took 2130.68ms. Allocated memory is still 275.8MB. Free memory was 235.0MB in the beginning and 208.6MB in the end (delta: 26.4MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-04-28 00:12:13,165 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.12ms. Allocated memory is still 174.1MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.67ms. Allocated memory was 174.1MB in the beginning and 275.8MB in the end (delta: 101.7MB). Free memory was 118.2MB in the beginning and 249.2MB in the end (delta: -131.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.31ms. Allocated memory is still 275.8MB. Free memory was 249.2MB in the beginning and 247.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.12ms. Allocated memory is still 275.8MB. Free memory was 247.5MB in the beginning and 236.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 48.69ms. Allocated memory is still 275.8MB. Free memory was 236.7MB in the beginning and 235.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2130.68ms. Allocated memory is still 275.8MB. Free memory was 235.0MB in the beginning and 208.6MB in the end (delta: 26.4MB). Peak memory consumption was 27.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: 18]: 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)=4, counter=0] [L24] unsigned int z, k; [L25] long long x, y, c; [L26] z = __VERIFIER_nondet_uint() [L27] k = __VERIFIER_nondet_uint() [L29] x = 1 [L30] y = z [L31] c = 1 VAL [\old(counter)=0, c=1, counter=0, k=0, x=1, y=0, z=0] [L33] EXPR counter++ VAL [\old(counter)=0, c=1, counter=1, counter++=0, k=0, x=1, y=0, z=0] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(counter)=0, c=1, counter=1, k=0, x=1, y=0, z=0] [L36] COND TRUE !(c < k) VAL [\old(counter)=0, c=1, counter=1, k=0, x=1, y=0, z=0] [L45] x = x * (z - 1) VAL [\old(counter)=0, c=1, counter=1, k=0, x=4294967295, y=0, z=0] [L47] CALL __VERIFIER_assert(1 + x - y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=1] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 58 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 83 SizeOfPredicates, 2 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 00:12:13,206 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...