./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm2_unwindbound20.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/lcm2_unwindbound20.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 21f79dea7aad8546a3e0176902289dccc4338c9a5ec0cb74e31e8a84f408fa52 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:35:46,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:35:46,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:35:46,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:35:46,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:35:46,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:35:46,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:35:46,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:35:46,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:35:46,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:35:46,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:35:46,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:35:46,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:35:46,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:35:46,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:35:46,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:35:46,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:35:46,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:35:46,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:35:46,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:35:46,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:35:46,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:35:46,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:35:46,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:35:46,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:35:46,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:35:46,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:35:46,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:35:46,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:35:46,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:35:46,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:35:46,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:35:46,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:35:46,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:35:46,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:35:46,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:35:46,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:35:46,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:35:46,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:35:46,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:35:46,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:35:46,275 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:35:46,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:35:46,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:35:46,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:35:46,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:35:46,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:35:46,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:35:46,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:35:46,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:35:46,296 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:35:46,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:35:46,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:35:46,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:35:46,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:35:46,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:35:46,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:35:46,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:35:46,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:35:46,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:35:46,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:35:46,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:35:46,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:35:46,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:35:46,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:35:46,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:35:46,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:35:46,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:35:46,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:35:46,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:35:46,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:35:46,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:35:46,304 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:35:46,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:35:46,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:35:46,304 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 -> 21f79dea7aad8546a3e0176902289dccc4338c9a5ec0cb74e31e8a84f408fa52 [2022-02-20 17:35:46,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:35:46,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:35:46,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:35:46,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:35:46,472 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:35:46,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm2_unwindbound20.c [2022-02-20 17:35:46,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac308728/68f065be5f77460ca56c8cd80cae9cdb/FLAG0bfaa257c [2022-02-20 17:35:46,863 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:35:46,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm2_unwindbound20.c [2022-02-20 17:35:46,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac308728/68f065be5f77460ca56c8cd80cae9cdb/FLAG0bfaa257c [2022-02-20 17:35:46,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac308728/68f065be5f77460ca56c8cd80cae9cdb [2022-02-20 17:35:46,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:35:46,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:35:46,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:35:46,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:35:46,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:35:46,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:35:46" (1/1) ... [2022-02-20 17:35:46,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55463331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:46, skipping insertion in model container [2022-02-20 17:35:46,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:35:46" (1/1) ... [2022-02-20 17:35:46,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:35:46,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:35:47,009 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/lcm2_unwindbound20.c[537,550] [2022-02-20 17:35:47,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:35:47,056 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:35:47,065 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/lcm2_unwindbound20.c[537,550] [2022-02-20 17:35:47,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:35:47,079 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:35:47,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47 WrapperNode [2022-02-20 17:35:47,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:35:47,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:35:47,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:35:47,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:35:47,090 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:35:47" (1/1) ... [2022-02-20 17:35:47,096 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:35:47" (1/1) ... [2022-02-20 17:35:47,123 INFO L137 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2022-02-20 17:35:47,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:35:47,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:35:47,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:35:47,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:35:47,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (1/1) ... [2022-02-20 17:35:47,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (1/1) ... [2022-02-20 17:35:47,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (1/1) ... [2022-02-20 17:35:47,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (1/1) ... [2022-02-20 17:35:47,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (1/1) ... [2022-02-20 17:35:47,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (1/1) ... [2022-02-20 17:35:47,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (1/1) ... [2022-02-20 17:35:47,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:35:47,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:35:47,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:35:47,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:35:47,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (1/1) ... [2022-02-20 17:35:47,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:35:47,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:47,181 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:35:47,186 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:35:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:35:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:35:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:35:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:35:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:35:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:35:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:35:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:35:47,261 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:35:47,262 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:35:47,409 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:35:47,413 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:35:47,414 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:35:47,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:35:47 BoogieIcfgContainer [2022-02-20 17:35:47,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:35:47,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:35:47,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:35:47,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:35:47,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:35:46" (1/3) ... [2022-02-20 17:35:47,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615bc62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:35:47, skipping insertion in model container [2022-02-20 17:35:47,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:47" (2/3) ... [2022-02-20 17:35:47,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615bc62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:35:47, skipping insertion in model container [2022-02-20 17:35:47,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:35:47" (3/3) ... [2022-02-20 17:35:47,423 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_unwindbound20.c [2022-02-20 17:35:47,426 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:35:47,426 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:35:47,457 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:35:47,463 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:35:47,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:35:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:35:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:35:47,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:47,483 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:35:47,483 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1908356592, now seen corresponding path program 1 times [2022-02-20 17:35:47,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:47,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023457803] [2022-02-20 17:35:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:35:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:47,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:35:47,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:35:47,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:35:47,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #58#return; {31#false} is VALID [2022-02-20 17:35:47,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:35:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:47,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:35:47,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:35:47,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:35:47,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #60#return; {31#false} is VALID [2022-02-20 17:35:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 17:35:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:47,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:35:47,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:35:47,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:35:47,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #62#return; {31#false} is VALID [2022-02-20 17:35:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:35:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:47,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:35:47,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:35:47,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:35:47,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #64#return; {31#false} is VALID [2022-02-20 17:35:47,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#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(50, 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; {30#true} is VALID [2022-02-20 17:35:47,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#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~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; {30#true} is VALID [2022-02-20 17:35:47,624 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {30#true} is VALID [2022-02-20 17:35:47,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:35:47,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:35:47,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:35:47,625 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31#false} {30#true} #58#return; {31#false} is VALID [2022-02-20 17:35:47,625 INFO L272 TraceCheckUtils]: 7: Hoare triple {31#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {30#true} is VALID [2022-02-20 17:35:47,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:35:47,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:35:47,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:35:47,626 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {31#false} {31#false} #60#return; {31#false} is VALID [2022-02-20 17:35:47,626 INFO L272 TraceCheckUtils]: 12: Hoare triple {31#false} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {30#true} is VALID [2022-02-20 17:35:47,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:35:47,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:35:47,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:35:47,627 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31#false} {31#false} #62#return; {31#false} is VALID [2022-02-20 17:35:47,627 INFO L272 TraceCheckUtils]: 17: Hoare triple {31#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {30#true} is VALID [2022-02-20 17:35:47,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:35:47,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:35:47,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:35:47,628 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {31#false} {31#false} #64#return; {31#false} is VALID [2022-02-20 17:35:47,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {31#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 := main_~a~0#1; {31#false} is VALID [2022-02-20 17:35:47,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {31#false} assume !true; {31#false} is VALID [2022-02-20 17:35:47,629 INFO L272 TraceCheckUtils]: 24: Hoare triple {31#false} call __VERIFIER_assert((if (main_~x~0#1 * main_~u~0#1 + main_~y~0#1 * main_~v~0#1) % 4294967296 == 2 * main_~a~0#1 * main_~b~0#1 % 4294967296 then 1 else 0)); {31#false} is VALID [2022-02-20 17:35:47,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-02-20 17:35:47,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-02-20 17:35:47,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:35:47,630 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:35:47,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:35:47,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023457803] [2022-02-20 17:35:47,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023457803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:35:47,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:35:47,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:35:47,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309933012] [2022-02-20 17:35:47,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:35:47,636 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:35:47,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:35:47,639 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:35:47,658 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:35:47,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:35:47,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:35:47,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:35:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:35:47,705 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:35:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:47,757 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-02-20 17:35:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:35:47,758 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:35:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:35:47,759 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:35:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 17:35:47,776 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:35:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 17:35:47,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 17:35:47,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:35:47,891 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:35:47,896 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:35:47,899 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:35:47,901 INFO L933 BasicCegarLoop]: 33 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, 33 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:35:47,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:35:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:35:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:35:47,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:35:47,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:35:47,930 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:35:47,931 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:35:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:47,941 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-20 17:35:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 17:35:47,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:47,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:47,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-02-20 17:35:47,943 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-02-20 17:35:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:47,950 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-20 17:35:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 17:35:47,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:47,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:47,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:35:47,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:35:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:35:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-02-20 17:35:47,960 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 28 [2022-02-20 17:35:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:35:47,960 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-20 17:35:47,961 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:35:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 17:35:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:35:47,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:47,963 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:35:47,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:35:47,964 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash 384922192, now seen corresponding path program 1 times [2022-02-20 17:35:47,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:47,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897427628] [2022-02-20 17:35:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:48,002 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:35:48,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356149362] [2022-02-20 17:35:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:48,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:35:48,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:48,024 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:35:48,051 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:35:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:48,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 17:35:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:48,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:35:48,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#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(50, 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; {198#true} is VALID [2022-02-20 17:35:48,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#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~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; {198#true} is VALID [2022-02-20 17:35:48,521 INFO L272 TraceCheckUtils]: 2: Hoare triple {198#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {198#true} is VALID [2022-02-20 17:35:48,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:35:48,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:35:48,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:35:48,521 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {198#true} {198#true} #58#return; {198#true} is VALID [2022-02-20 17:35:48,522 INFO L272 TraceCheckUtils]: 7: Hoare triple {198#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {198#true} is VALID [2022-02-20 17:35:48,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:35:48,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:35:48,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:35:48,522 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {198#true} {198#true} #60#return; {198#true} is VALID [2022-02-20 17:35:48,522 INFO L272 TraceCheckUtils]: 12: Hoare triple {198#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {198#true} is VALID [2022-02-20 17:35:48,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:35:48,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:35:48,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:35:48,523 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {198#true} {198#true} #62#return; {198#true} is VALID [2022-02-20 17:35:48,523 INFO L272 TraceCheckUtils]: 17: Hoare triple {198#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {198#true} is VALID [2022-02-20 17:35:48,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:35:48,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:35:48,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:35:48,524 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {198#true} {198#true} #64#return; {198#true} is VALID [2022-02-20 17:35:48,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {198#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 := main_~a~0#1; {269#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:35:48,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {269#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~v~0#1|) (= |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; {269#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:35:48,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {269#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {269#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:35:48,526 INFO L272 TraceCheckUtils]: 25: Hoare triple {269#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~v~0#1|) (= |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 == 2 * main_~a~0#1 * main_~b~0#1 % 4294967296 then 1 else 0)); {279#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-02-20 17:35:48,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {279#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:35:48,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {199#false} is VALID [2022-02-20 17:35:48,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-02-20 17:35:48,528 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:35:48,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:35:48,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:35:48,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897427628] [2022-02-20 17:35:48,528 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:35:48,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356149362] [2022-02-20 17:35:48,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356149362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:35:48,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:35:48,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:35:48,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130370989] [2022-02-20 17:35:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:35:48,530 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:35:48,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:35:48,531 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:35:48,564 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:35:48,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:35:48,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:35:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:35:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:35:48,566 INFO L87 Difference]: Start difference. First operand 23 states and 29 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:35:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:48,690 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-02-20 17:35:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:35:48,691 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:35:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:35:48,691 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:35:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-20 17:35:48,693 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:35:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-20 17:35:48,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-02-20 17:35:48,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:35:48,758 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:35:48,758 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:35:48,758 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:35:48,759 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:35:48,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 88 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:35:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:35:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-20 17:35:48,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:35:48,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:35:48,763 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:35:48,764 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:35:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:48,766 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-20 17:35:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 17:35:48,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:48,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:48,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:35:48,767 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:35:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:48,768 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-20 17:35:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 17:35:48,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:48,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:48,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:35:48,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:35:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:35:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 17:35:48,771 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 29 [2022-02-20 17:35:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:35:48,771 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 17:35:48,771 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:35:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 17:35:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:35:48,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:48,772 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:35:48,791 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:35:48,987 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:35:48,987 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash -449676311, now seen corresponding path program 1 times [2022-02-20 17:35:48,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:48,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377623601] [2022-02-20 17:35:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:49,004 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:35:49,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462239679] [2022-02-20 17:35:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:35:49,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:49,006 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:35:49,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process