./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash befa5004268d4c15cae2c05402ac6cc0f86cef85e498084909e66f7e8cc4b8f3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:34:52,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:34:52,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:34:52,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:34:52,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:34:52,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:34:52,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:34:52,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:34:52,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:34:52,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:34:52,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:34:52,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:34:52,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:34:52,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:34:52,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:34:52,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:34:52,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:34:52,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:34:52,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:34:52,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:34:52,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:34:52,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:34:52,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:34:52,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:34:52,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:34:52,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:34:52,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:34:52,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:34:52,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:34:52,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:34:52,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:34:52,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:34:52,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:34:52,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:34:52,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:34:52,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:34:52,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:34:52,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:34:52,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:34:52,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:34:52,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:34:52,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:34:52,143 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:34:52,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:34:52,144 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:34:52,144 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:34:52,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:34:52,145 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:34:52,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:34:52,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:34:52,146 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:34:52,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:34:52,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:34:52,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:34:52,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:34:52,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:34:52,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:34:52,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:34:52,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:34:52,148 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:34:52,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:34:52,148 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:34:52,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:34:52,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:34:52,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:34:52,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:34:52,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:34:52,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:34:52,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:34:52,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:34:52,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:34:52,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:34:52,150 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:34:52,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:34:52,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:34:52,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> befa5004268d4c15cae2c05402ac6cc0f86cef85e498084909e66f7e8cc4b8f3 [2022-02-20 17:34:52,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:34:52,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:34:52,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:34:52,349 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:34:52,350 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:34:52,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c [2022-02-20 17:34:52,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf60aefba/b455382d69f54ebc96d97c27153e6ca7/FLAG729fe4d85 [2022-02-20 17:34:52,714 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:34:52,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c [2022-02-20 17:34:52,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf60aefba/b455382d69f54ebc96d97c27153e6ca7/FLAG729fe4d85 [2022-02-20 17:34:53,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf60aefba/b455382d69f54ebc96d97c27153e6ca7 [2022-02-20 17:34:53,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:34:53,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:34:53,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:34:53,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:34:53,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:34:53,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fef935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53, skipping insertion in model container [2022-02-20 17:34:53,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:34:53,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:34:53,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c[552,565] [2022-02-20 17:34:53,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:34:53,339 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:34:53,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c[552,565] [2022-02-20 17:34:53,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:34:53,362 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:34:53,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53 WrapperNode [2022-02-20 17:34:53,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:34:53,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:34:53,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:34:53,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:34:53,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,386 INFO L137 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-02-20 17:34:53,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:34:53,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:34:53,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:34:53,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:34:53,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:34:53,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:34:53,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:34:53,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:34:53,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (1/1) ... [2022-02-20 17:34:53,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:34:53,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:34:53,446 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-02-20 17:34:53,456 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-02-20 17:34:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:34:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:34:53,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:34:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:34:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:34:53,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:34:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:34:53,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:34:53,513 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:34:53,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:34:53,627 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:34:53,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:34:53,632 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 17:34:53,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:34:53 BoogieIcfgContainer [2022-02-20 17:34:53,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:34:53,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:34:53,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:34:53,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:34:53,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:34:53" (1/3) ... [2022-02-20 17:34:53,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229cda96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:34:53, skipping insertion in model container [2022-02-20 17:34:53,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:34:53" (2/3) ... [2022-02-20 17:34:53,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229cda96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:34:53, skipping insertion in model container [2022-02-20 17:34:53,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:34:53" (3/3) ... [2022-02-20 17:34:53,641 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound5.c [2022-02-20 17:34:53,645 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:34:53,645 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:34:53,674 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:34:53,678 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:34:53,678 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:34:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:34:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:34:53,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:34:53,731 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:34:53,731 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:34:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:34:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1730809867, now seen corresponding path program 1 times [2022-02-20 17:34:53,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:34:53,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544222815] [2022-02-20 17:34:53,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:34:53,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:34:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:34:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:53,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:34:53,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:34:53,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:34:53,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #90#return; {39#false} is VALID [2022-02-20 17:34:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:34:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:53,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:34:53,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:34:53,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:34:53,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #92#return; {39#false} is VALID [2022-02-20 17:34:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 17:34:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:53,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:34:53,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:34:53,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:34:53,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #94#return; {39#false} is VALID [2022-02-20 17:34:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:34:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:53,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:34:53,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:34:53,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:34:53,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #96#return; {39#false} is VALID [2022-02-20 17:34:53,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38#true} is VALID [2022-02-20 17:34:53,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~u~0#1, main_~v~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~u~0#1;havoc main_~v~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {38#true} is VALID [2022-02-20 17:34:53,969 INFO L272 TraceCheckUtils]: 2: Hoare triple {38#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-02-20 17:34:53,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:34:53,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:34:53,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:34:53,971 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39#false} {38#true} #90#return; {39#false} is VALID [2022-02-20 17:34:53,971 INFO L272 TraceCheckUtils]: 7: Hoare triple {39#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-02-20 17:34:53,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:34:53,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:34:53,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:34:53,972 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {39#false} {39#false} #92#return; {39#false} is VALID [2022-02-20 17:34:53,973 INFO L272 TraceCheckUtils]: 12: Hoare triple {39#false} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {38#true} is VALID [2022-02-20 17:34:53,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:34:53,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:34:53,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:34:53,974 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {39#false} {39#false} #94#return; {39#false} is VALID [2022-02-20 17:34:53,974 INFO L272 TraceCheckUtils]: 17: Hoare triple {39#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {38#true} is VALID [2022-02-20 17:34:53,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:34:53,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:34:53,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:34:53,977 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {39#false} {39#false} #96#return; {39#false} is VALID [2022-02-20 17:34:53,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {39#false} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~u~0#1 := main_~b~0#1;main_~v~0#1 := 0; {39#false} is VALID [2022-02-20 17:34:53,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-02-20 17:34:53,978 INFO L272 TraceCheckUtils]: 24: Hoare triple {39#false} call __VERIFIER_assert((if (main_~u~0#1 * main_~y~0#1 + main_~v~0#1 * main_~y~0#1) % 4294967296 == main_~a~0#1 * main_~b~0#1 % 4294967296 then 1 else 0)); {39#false} is VALID [2022-02-20 17:34:53,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-02-20 17:34:53,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-02-20 17:34:53,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 17:34:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:34:53,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:34:53,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544222815] [2022-02-20 17:34:53,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544222815] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:34:53,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:34:53,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:34:53,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192704791] [2022-02-20 17:34:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:34:53,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-02-20 17:34:53,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:34:53,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:54,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:54,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:34:54,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:34:54,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:34:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:34:54,047 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:54,136 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2022-02-20 17:34:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:34:54,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-02-20 17:34:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:34:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2022-02-20 17:34:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2022-02-20 17:34:54,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 109 transitions. [2022-02-20 17:34:54,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:54,294 INFO L225 Difference]: With dead ends: 67 [2022-02-20 17:34:54,294 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 17:34:54,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:34:54,299 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:34:54,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:34:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 17:34:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 17:34:54,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:34:54,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:34:54,321 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:34:54,322 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:34:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:54,325 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-02-20 17:34:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-02-20 17:34:54,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:54,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:54,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-02-20 17:34:54,326 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-02-20 17:34:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:54,329 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-02-20 17:34:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-02-20 17:34:54,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:54,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:54,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:34:54,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:34:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:34:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-02-20 17:34:54,334 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 28 [2022-02-20 17:34:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:34:54,335 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-02-20 17:34:54,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-02-20 17:34:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:34:54,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:34:54,336 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:34:54,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:34:54,337 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:34:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:34:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1744809392, now seen corresponding path program 1 times [2022-02-20 17:34:54,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:34:54,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254220042] [2022-02-20 17:34:54,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:34:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:34:54,358 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:34:54,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282040087] [2022-02-20 17:34:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:34:54,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:34:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:34:54,360 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-02-20 17:34:54,361 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-02-20 17:34:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:54,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:34:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:54,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:34:54,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {258#true} is VALID [2022-02-20 17:34:54,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~u~0#1, main_~v~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~u~0#1;havoc main_~v~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {258#true} is VALID [2022-02-20 17:34:54,553 INFO L272 TraceCheckUtils]: 2: Hoare triple {258#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {258#true} is VALID [2022-02-20 17:34:54,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-02-20 17:34:54,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-02-20 17:34:54,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} assume true; {258#true} is VALID [2022-02-20 17:34:54,554 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {258#true} {258#true} #90#return; {258#true} is VALID [2022-02-20 17:34:54,554 INFO L272 TraceCheckUtils]: 7: Hoare triple {258#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {258#true} is VALID [2022-02-20 17:34:54,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-02-20 17:34:54,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-02-20 17:34:54,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#true} assume true; {258#true} is VALID [2022-02-20 17:34:54,555 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {258#true} {258#true} #92#return; {258#true} is VALID [2022-02-20 17:34:54,555 INFO L272 TraceCheckUtils]: 12: Hoare triple {258#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {258#true} is VALID [2022-02-20 17:34:54,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-02-20 17:34:54,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-02-20 17:34:54,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {258#true} assume true; {258#true} is VALID [2022-02-20 17:34:54,556 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {258#true} {258#true} #94#return; {258#true} is VALID [2022-02-20 17:34:54,556 INFO L272 TraceCheckUtils]: 17: Hoare triple {258#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {258#true} is VALID [2022-02-20 17:34:54,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {258#true} ~cond := #in~cond; {258#true} is VALID [2022-02-20 17:34:54,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {258#true} assume !(0 == ~cond); {258#true} is VALID [2022-02-20 17:34:54,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {258#true} assume true; {258#true} is VALID [2022-02-20 17:34:54,557 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {258#true} {258#true} #96#return; {258#true} is VALID [2022-02-20 17:34:54,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {258#true} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~u~0#1 := main_~b~0#1;main_~v~0#1 := 0; {329#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:34:54,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {329#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {329#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:34:54,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {329#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {329#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:34:54,560 INFO L272 TraceCheckUtils]: 25: Hoare triple {329#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if (main_~x~0#1 * main_~u~0#1 + main_~y~0#1 * main_~v~0#1) % 4294967296 == main_~a~0#1 * main_~b~0#1 % 4294967296 then 1 else 0)); {339#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:34:54,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {339#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {343#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:34:54,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {343#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {259#false} is VALID [2022-02-20 17:34:54,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-02-20 17:34:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:34:54,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:34:54,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:34:54,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254220042] [2022-02-20 17:34:54,562 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:34:54,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282040087] [2022-02-20 17:34:54,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282040087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:34:54,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:34:54,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:34:54,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771407830] [2022-02-20 17:34:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:34:54,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-02-20 17:34:54,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:34:54,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:54,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:54,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:34:54,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:34:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:34:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:34:54,583 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:54,785 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-02-20 17:34:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:34:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-02-20 17:34:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:34:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 17:34:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 17:34:54,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-02-20 17:34:54,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:54,857 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:34:54,857 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 17:34:54,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-02-20 17:34:54,858 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 16 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:34:54,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 136 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:34:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 17:34:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-02-20 17:34:54,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:34:54,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:34:54,865 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:34:54,865 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:34:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:54,867 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2022-02-20 17:34:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2022-02-20 17:34:54,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:54,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:54,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-02-20 17:34:54,869 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-02-20 17:34:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:54,871 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2022-02-20 17:34:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2022-02-20 17:34:54,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:54,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:54,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:34:54,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:34:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:34:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2022-02-20 17:34:54,875 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 29 [2022-02-20 17:34:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:34:54,875 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2022-02-20 17:34:54,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2022-02-20 17:34:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:34:54,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:34:54,876 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:34:54,918 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-02-20 17:34:55,093 WARN L452 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-02-20 17:34:55,093 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:34:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:34:55,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1746477688, now seen corresponding path program 1 times [2022-02-20 17:34:55,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:34:55,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802965912] [2022-02-20 17:34:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:34:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:34:55,109 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:34:55,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258961556] [2022-02-20 17:34:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:34:55,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:34:55,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:34:55,114 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-02-20 17:34:55,116 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-02-20 17:34:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:55,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:34:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:55,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:34:55,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {587#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {592#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~u~0#1, main_~v~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~u~0#1;havoc main_~v~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,278 INFO L272 TraceCheckUtils]: 2: Hoare triple {592#(<= ~counter~0 0)} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {592#(<= ~counter~0 0)} ~cond := #in~cond; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {592#(<= ~counter~0 0)} assume !(0 == ~cond); {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {592#(<= ~counter~0 0)} assume true; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,280 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {592#(<= ~counter~0 0)} {592#(<= ~counter~0 0)} #90#return; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,280 INFO L272 TraceCheckUtils]: 7: Hoare triple {592#(<= ~counter~0 0)} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {592#(<= ~counter~0 0)} ~cond := #in~cond; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= ~counter~0 0)} assume !(0 == ~cond); {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= ~counter~0 0)} assume true; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,282 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {592#(<= ~counter~0 0)} {592#(<= ~counter~0 0)} #92#return; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {592#(<= ~counter~0 0)} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#(<= ~counter~0 0)} ~cond := #in~cond; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(<= ~counter~0 0)} assume !(0 == ~cond); {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {592#(<= ~counter~0 0)} assume true; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,284 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {592#(<= ~counter~0 0)} {592#(<= ~counter~0 0)} #94#return; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,284 INFO L272 TraceCheckUtils]: 17: Hoare triple {592#(<= ~counter~0 0)} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {592#(<= ~counter~0 0)} ~cond := #in~cond; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {592#(<= ~counter~0 0)} assume !(0 == ~cond); {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {592#(<= ~counter~0 0)} assume true; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,286 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {592#(<= ~counter~0 0)} {592#(<= ~counter~0 0)} #96#return; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {592#(<= ~counter~0 0)} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~u~0#1 := main_~b~0#1;main_~v~0#1 := 0; {592#(<= ~counter~0 0)} is VALID [2022-02-20 17:34:55,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {592#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {662#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:34:55,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {662#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {588#false} is VALID [2022-02-20 17:34:55,288 INFO L272 TraceCheckUtils]: 25: Hoare triple {588#false} call __VERIFIER_assert((if (main_~u~0#1 * main_~y~0#1 + main_~v~0#1 * main_~y~0#1) % 4294967296 == main_~a~0#1 * main_~b~0#1 % 4294967296 then 1 else 0)); {588#false} is VALID [2022-02-20 17:34:55,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-02-20 17:34:55,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-02-20 17:34:55,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-02-20 17:34:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:34:55,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:34:55,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:34:55,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802965912] [2022-02-20 17:34:55,289 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:34:55,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258961556] [2022-02-20 17:34:55,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258961556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:34:55,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:34:55,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:34:55,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109702724] [2022-02-20 17:34:55,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:34:55,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-02-20 17:34:55,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:34:55,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:55,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:55,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:34:55,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:34:55,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:34:55,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:34:55,306 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:55,379 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-02-20 17:34:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:34:55,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-02-20 17:34:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:34:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 17:34:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 17:34:55,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-02-20 17:34:55,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:55,420 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:34:55,421 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 17:34:55,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-02-20 17:34:55,422 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:34:55,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:34:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 17:34:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-02-20 17:34:55,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:34:55,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:34:55,431 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:34:55,431 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:34:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:55,433 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2022-02-20 17:34:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2022-02-20 17:34:55,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:55,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:55,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-02-20 17:34:55,435 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-02-20 17:34:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:55,436 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2022-02-20 17:34:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2022-02-20 17:34:55,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:55,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:55,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:34:55,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:34:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:34:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2022-02-20 17:34:55,440 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 29 [2022-02-20 17:34:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:34:55,440 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2022-02-20 17:34:55,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:34:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2022-02-20 17:34:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:34:55,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:34:55,441 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:34:55,458 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-02-20 17:34:55,658 WARN L452 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-02-20 17:34:55,658 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:34:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:34:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1754973556, now seen corresponding path program 1 times [2022-02-20 17:34:55,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:34:55,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770700871] [2022-02-20 17:34:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:34:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:34:55,688 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:34:55,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960594543] [2022-02-20 17:34:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:34:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:34:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:34:55,690 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-02-20 17:34:55,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process