./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm2_valuebound20.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_valuebound20.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 654f2a5144415573fc1d6067bb4543ae0058de290c8f1b991cc759cea7560c8f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:36:40,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:36:40,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:36:40,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:36:40,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:36:40,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:36:40,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:36:40,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:36:40,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:36:40,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:36:40,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:36:40,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:36:40,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:36:40,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:36:40,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:36:40,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:36:40,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:36:40,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:36:40,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:36:40,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:36:40,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:36:40,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:36:40,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:36:40,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:36:40,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:36:40,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:36:40,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:36:40,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:36:40,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:36:40,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:36:40,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:36:40,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:36:40,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:36:40,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:36:40,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:36:40,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:36:40,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:36:40,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:36:40,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:36:40,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:36:40,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:36:40,438 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:36:40,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:36:40,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:36:40,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:36:40,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:36:40,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:36:40,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:36:40,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:36:40,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:36:40,469 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:36:40,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:36:40,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:36:40,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:36:40,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:36:40,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:36:40,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:36:40,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:36:40,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:36:40,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:36:40,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:36:40,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:36:40,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:36:40,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:36:40,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:36:40,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:36:40,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:36:40,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:36:40,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:36:40,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:36:40,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:36:40,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:36:40,473 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:36:40,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:36:40,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:36:40,473 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 -> 654f2a5144415573fc1d6067bb4543ae0058de290c8f1b991cc759cea7560c8f [2022-02-20 17:36:40,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:36:40,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:36:40,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:36:40,649 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:36:40,649 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:36:40,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm2_valuebound20.c [2022-02-20 17:36:40,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a3428dd/cd249475f60548df962febff8cfdb805/FLAGffdce7f89 [2022-02-20 17:36:41,024 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:36:41,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm2_valuebound20.c [2022-02-20 17:36:41,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a3428dd/cd249475f60548df962febff8cfdb805/FLAGffdce7f89 [2022-02-20 17:36:41,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13a3428dd/cd249475f60548df962febff8cfdb805 [2022-02-20 17:36:41,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:36:41,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:36:41,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:36:41,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:36:41,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:36:41,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d31f404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41, skipping insertion in model container [2022-02-20 17:36:41,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:36:41,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:36:41,168 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_valuebound20.c[537,550] [2022-02-20 17:36:41,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:36:41,185 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:36:41,195 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_valuebound20.c[537,550] [2022-02-20 17:36:41,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:36:41,211 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:36:41,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41 WrapperNode [2022-02-20 17:36:41,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:36:41,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:36:41,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:36:41,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:36:41,219 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:36:41" (1/1) ... [2022-02-20 17:36:41,223 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:36:41" (1/1) ... [2022-02-20 17:36:41,247 INFO L137 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2022-02-20 17:36:41,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:36:41,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:36:41,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:36:41,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:36:41,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:36:41,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:36:41,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:36:41,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:36:41,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (1/1) ... [2022-02-20 17:36:41,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:36:41,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:36:41,286 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:36:41,293 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:36:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:36:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:36:41,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:36:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:36:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:36:41,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:36:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:36:41,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:36:41,356 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:36:41,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:36:41,452 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:36:41,457 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:36:41,458 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:36:41,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:36:41 BoogieIcfgContainer [2022-02-20 17:36:41,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:36:41,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:36:41,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:36:41,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:36:41,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:36:41" (1/3) ... [2022-02-20 17:36:41,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f9e7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:36:41, skipping insertion in model container [2022-02-20 17:36:41,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:36:41" (2/3) ... [2022-02-20 17:36:41,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f9e7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:36:41, skipping insertion in model container [2022-02-20 17:36:41,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:36:41" (3/3) ... [2022-02-20 17:36:41,476 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_valuebound20.c [2022-02-20 17:36:41,479 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:36:41,482 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:36:41,539 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:36:41,547 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:36:41,547 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:36:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:36:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:36:41,566 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:36:41,566 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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:36:41,567 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:36:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:36:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash 902207739, now seen corresponding path program 1 times [2022-02-20 17:36:41,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:36:41,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112728478] [2022-02-20 17:36:41,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:36:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:36:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:36:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:41,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #60#return; {33#false} is VALID [2022-02-20 17:36:41,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:36:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:41,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #62#return; {33#false} is VALID [2022-02-20 17:36:41,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:36:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:41,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #64#return; {33#false} is VALID [2022-02-20 17:36:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:36:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:41,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #66#return; {33#false} is VALID [2022-02-20 17:36:41,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 17:36:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:41,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #68#return; {33#false} is VALID [2022-02-20 17:36:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 17:36:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:41,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #70#return; {33#false} is VALID [2022-02-20 17:36:41,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#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); {32#true} is VALID [2022-02-20 17:36:41,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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_~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; {32#true} is VALID [2022-02-20 17:36:41,840 INFO L272 TraceCheckUtils]: 2: Hoare triple {32#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 0 && main_~a~0#1 % 4294967296 <= 20 then 1 else 0)); {32#true} is VALID [2022-02-20 17:36:41,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,842 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {33#false} {32#true} #60#return; {33#false} is VALID [2022-02-20 17:36:41,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {33#false} is VALID [2022-02-20 17:36:41,843 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 0 && main_~b~0#1 % 4294967296 <= 20 then 1 else 0)); {32#true} is VALID [2022-02-20 17:36:41,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,844 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33#false} {33#false} #62#return; {33#false} is VALID [2022-02-20 17:36:41,844 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {32#true} is VALID [2022-02-20 17:36:41,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,846 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33#false} {33#false} #64#return; {33#false} is VALID [2022-02-20 17:36:41,846 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {32#true} is VALID [2022-02-20 17:36:41,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,847 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {33#false} {33#false} #66#return; {33#false} is VALID [2022-02-20 17:36:41,847 INFO L272 TraceCheckUtils]: 23: Hoare triple {33#false} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {32#true} is VALID [2022-02-20 17:36:41,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,851 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {33#false} {33#false} #68#return; {33#false} is VALID [2022-02-20 17:36:41,852 INFO L272 TraceCheckUtils]: 28: Hoare triple {33#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {32#true} is VALID [2022-02-20 17:36:41,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:36:41,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:36:41,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:36:41,854 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {33#false} {33#false} #70#return; {33#false} is VALID [2022-02-20 17:36:41,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {33#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; {33#false} is VALID [2022-02-20 17:36:41,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-02-20 17:36:41,856 INFO L272 TraceCheckUtils]: 35: Hoare triple {33#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)); {33#false} is VALID [2022-02-20 17:36:41,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-02-20 17:36:41,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-02-20 17:36:41,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 17:36:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:36:41,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:36:41,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112728478] [2022-02-20 17:36:41,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112728478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:36:41,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:36:41,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:36:41,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418879995] [2022-02-20 17:36:41,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:36:41,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-02-20 17:36:41,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:36:41,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:36:41,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:36:41,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:36:41,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:36:41,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:36:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:36:41,940 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:36:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:36:42,000 INFO L93 Difference]: Finished difference Result 55 states and 84 transitions. [2022-02-20 17:36:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:36:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-02-20 17:36:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:36:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:36:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 17:36:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:36:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 17:36:42,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2022-02-20 17:36:42,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:36:42,111 INFO L225 Difference]: With dead ends: 55 [2022-02-20 17:36:42,111 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 17:36:42,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:36:42,118 INFO L933 BasicCegarLoop]: 36 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, 36 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:36:42,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:36:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 17:36:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 17:36:42,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:36:42,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:36:42,145 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:36:42,146 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:36:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:36:42,153 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 17:36:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 17:36:42,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:36:42,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:36:42,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 25 states. [2022-02-20 17:36:42,156 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 25 states. [2022-02-20 17:36:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:36:42,161 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 17:36:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 17:36:42,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:36:42,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:36:42,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:36:42,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:36:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:36:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 17:36:42,166 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 39 [2022-02-20 17:36:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:36:42,166 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 17:36:42,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:36:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 17:36:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:36:42,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:36:42,168 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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:36:42,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:36:42,170 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:36:42,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:36:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash -722599373, now seen corresponding path program 1 times [2022-02-20 17:36:42,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:36:42,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411585405] [2022-02-20 17:36:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:36:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:36:42,201 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:36:42,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728216333] [2022-02-20 17:36:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:36:42,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:36:42,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:36:42,210 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:36:42,211 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:36:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:42,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 17:36:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:36:42,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:36:42,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#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); {224#true} is VALID [2022-02-20 17:36:42,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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_~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; {224#true} is VALID [2022-02-20 17:36:42,747 INFO L272 TraceCheckUtils]: 2: Hoare triple {224#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 0 && main_~a~0#1 % 4294967296 <= 20 then 1 else 0)); {224#true} is VALID [2022-02-20 17:36:42,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-02-20 17:36:42,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-02-20 17:36:42,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} assume true; {224#true} is VALID [2022-02-20 17:36:42,748 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {224#true} {224#true} #60#return; {224#true} is VALID [2022-02-20 17:36:42,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {224#true} is VALID [2022-02-20 17:36:42,748 INFO L272 TraceCheckUtils]: 8: Hoare triple {224#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 0 && main_~b~0#1 % 4294967296 <= 20 then 1 else 0)); {224#true} is VALID [2022-02-20 17:36:42,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-02-20 17:36:42,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-02-20 17:36:42,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume true; {224#true} is VALID [2022-02-20 17:36:42,749 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {224#true} {224#true} #62#return; {224#true} is VALID [2022-02-20 17:36:42,749 INFO L272 TraceCheckUtils]: 13: Hoare triple {224#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {224#true} is VALID [2022-02-20 17:36:42,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-02-20 17:36:42,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-02-20 17:36:42,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {224#true} assume true; {224#true} is VALID [2022-02-20 17:36:42,750 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {224#true} {224#true} #64#return; {224#true} is VALID [2022-02-20 17:36:42,750 INFO L272 TraceCheckUtils]: 18: Hoare triple {224#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {224#true} is VALID [2022-02-20 17:36:42,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-02-20 17:36:42,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-02-20 17:36:42,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {224#true} assume true; {224#true} is VALID [2022-02-20 17:36:42,751 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-02-20 17:36:42,751 INFO L272 TraceCheckUtils]: 23: Hoare triple {224#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {224#true} is VALID [2022-02-20 17:36:42,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-02-20 17:36:42,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-02-20 17:36:42,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {224#true} assume true; {224#true} is VALID [2022-02-20 17:36:42,753 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {224#true} {224#true} #68#return; {224#true} is VALID [2022-02-20 17:36:42,754 INFO L272 TraceCheckUtils]: 28: Hoare triple {224#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {224#true} is VALID [2022-02-20 17:36:42,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-02-20 17:36:42,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-02-20 17:36:42,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {224#true} assume true; {224#true} is VALID [2022-02-20 17:36:42,754 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {224#true} {224#true} #70#return; {224#true} is VALID [2022-02-20 17:36:42,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {224#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; {328#(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:36:42,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {328#(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 !false; {328#(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:36:42,757 INFO L272 TraceCheckUtils]: 35: Hoare triple {328#(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)); {335#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-02-20 17:36:42,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {335#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:36:42,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-02-20 17:36:42,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-02-20 17:36:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:36:42,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:36:42,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:36:42,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411585405] [2022-02-20 17:36:42,761 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:36:42,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728216333] [2022-02-20 17:36:42,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728216333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:36:42,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:36:42,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:36:42,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361307011] [2022-02-20 17:36:42,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:36:42,768 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-02-20 17:36:42,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:36:42,769 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:36:42,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:36:42,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:36:42,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:36:42,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:36:42,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:36:42,793 INFO L87 Difference]: Start difference. First operand 25 states and 32 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:36:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:36:42,932 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 17:36:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:36:42,932 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-02-20 17:36:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:36:42,932 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:36:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:36:42,934 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:36:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:36:42,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 17:36:42,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:36:42,985 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:36:42,985 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:36:42,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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:36:42,986 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:36:42,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:36:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:36:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-02-20 17:36:42,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:36:42,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:36:42,990 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:36:42,990 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:36:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:36:42,992 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 17:36:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 17:36:42,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:36:42,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:36:42,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-02-20 17:36:42,993 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-02-20 17:36:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:36:42,995 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 17:36:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 17:36:42,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:36:42,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:36:42,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:36:42,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:36:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:36:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-02-20 17:36:42,998 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 39 [2022-02-20 17:36:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:36:42,998 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-02-20 17:36:42,998 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:36:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 17:36:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 17:36:42,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:36:42,999 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 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:36:43,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:36:43,208 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:36:43,208 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:36:43,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:36:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1459116230, now seen corresponding path program 1 times [2022-02-20 17:36:43,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:36:43,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111686996] [2022-02-20 17:36:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:36:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:36:43,247 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:36:43,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787851842] [2022-02-20 17:36:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:36:43,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:36:43,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:36:43,249 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:36:43,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process