./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-u_unwindbound10.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/geo1-u_unwindbound10.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 97bfd47a763eadf3b0af2f8e585b7163ffc0c68bcbafc8205f8cd9e774a99e69 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:28:51,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:28:51,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:28:51,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:28:51,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:28:51,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:28:51,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:28:51,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:28:51,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:28:51,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:28:51,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:28:51,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:28:51,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:28:51,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:28:51,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:28:51,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:28:51,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:28:51,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:28:51,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:28:51,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:28:51,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:28:51,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:28:51,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:28:51,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:28:51,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:28:51,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:28:51,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:28:51,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:28:51,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:28:51,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:28:51,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:28:51,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:28:51,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:28:51,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:28:51,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:28:51,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:28:51,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:28:51,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:28:51,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:28:51,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:28:51,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:28:51,528 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:28:51,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:28:51,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:28:51,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:28:51,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:28:51,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:28:51,556 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:28:51,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:28:51,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:28:51,556 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:28:51,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:28:51,557 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:28:51,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:28:51,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:28:51,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:28:51,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:28:51,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:28:51,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:28:51,559 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:28:51,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:28:51,559 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:28:51,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:28:51,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:28:51,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:28:51,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:28:51,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:28:51,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:28:51,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:28:51,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:28:51,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:28:51,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:28:51,562 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:28:51,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:28:51,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:28:51,563 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 -> 97bfd47a763eadf3b0af2f8e585b7163ffc0c68bcbafc8205f8cd9e774a99e69 [2022-02-20 17:28:51,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:28:51,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:28:51,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:28:51,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:28:51,810 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:28:51,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u_unwindbound10.c [2022-02-20 17:28:51,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8756e9a2/641907547c0b4a1dbc887241f092e0c7/FLAG18bc51a76 [2022-02-20 17:28:52,228 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:28:52,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_unwindbound10.c [2022-02-20 17:28:52,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8756e9a2/641907547c0b4a1dbc887241f092e0c7/FLAG18bc51a76 [2022-02-20 17:28:52,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8756e9a2/641907547c0b4a1dbc887241f092e0c7 [2022-02-20 17:28:52,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:28:52,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:28:52,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:28:52,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:28:52,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:28:52,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1152cb80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52, skipping insertion in model container [2022-02-20 17:28:52,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:28:52,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:28:52,418 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/geo1-u_unwindbound10.c[555,568] [2022-02-20 17:28:52,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:28:52,439 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:28:52,461 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/geo1-u_unwindbound10.c[555,568] [2022-02-20 17:28:52,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:28:52,479 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:28:52,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52 WrapperNode [2022-02-20 17:28:52,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:28:52,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:28:52,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:28:52,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:28:52,485 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:28:52" (1/1) ... [2022-02-20 17:28:52,490 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:28:52" (1/1) ... [2022-02-20 17:28:52,507 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2022-02-20 17:28:52,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:28:52,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:28:52,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:28:52,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:28:52,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:28:52,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:28:52,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:28:52,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:28:52,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (1/1) ... [2022-02-20 17:28:52,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:28:52,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:52,565 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:28:52,583 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:28:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:28:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:28:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:28:52,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:28:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:28:52,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:28:52,651 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:28:52,652 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:28:52,738 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:28:52,744 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:28:52,744 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:28:52,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:52 BoogieIcfgContainer [2022-02-20 17:28:52,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:28:52,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:28:52,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:28:52,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:28:52,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:28:52" (1/3) ... [2022-02-20 17:28:52,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3f16d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:28:52, skipping insertion in model container [2022-02-20 17:28:52,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:52" (2/3) ... [2022-02-20 17:28:52,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3f16d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:28:52, skipping insertion in model container [2022-02-20 17:28:52,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:52" (3/3) ... [2022-02-20 17:28:52,754 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_unwindbound10.c [2022-02-20 17:28:52,759 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:28:52,759 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:28:52,799 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:28:52,805 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:28:52,806 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:28:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:28:52,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:52,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:52,844 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 561702714, now seen corresponding path program 1 times [2022-02-20 17:28:52,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:52,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464118325] [2022-02-20 17:28:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:53,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21#true} is VALID [2022-02-20 17:28:53,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#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_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {21#true} is VALID [2022-02-20 17:28:53,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-20 17:28:53,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} main_~x~0#1 := main_~x~0#1 * ((main_~z~0#1 - 1) % 4294967296); {22#false} is VALID [2022-02-20 17:28:53,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 - main_~y~0#1 then 1 else 0)); {22#false} is VALID [2022-02-20 17:28:53,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-02-20 17:28:53,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-02-20 17:28:53,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 17:28:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:28:53,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:53,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464118325] [2022-02-20 17:28:53,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464118325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:53,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:53,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:28:53,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764189530] [2022-02-20 17:28:53,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:28:53,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:53,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:53,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:28:53,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:28:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:28:53,110 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:53,145 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 17:28:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:28:53,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:28:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2022-02-20 17:28:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2022-02-20 17:28:53,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 44 transitions. [2022-02-20 17:28:53,265 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:28:53,272 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:28:53,272 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 17:28:53,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:28:53,278 INFO L933 BasicCegarLoop]: 20 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, 20 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:28:53,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 17:28:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 17:28:53,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:53,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:28:53,311 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:28:53,312 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:28:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:53,316 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-20 17:28:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:28:53,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:53,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:53,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-02-20 17:28:53,317 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-02-20 17:28:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:53,320 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-20 17:28:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:28:53,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:53,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:53,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:53,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:28:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 17:28:53,324 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2022-02-20 17:28:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:53,324 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 17:28:53,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:28:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:28:53,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:53,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:53,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:28:53,326 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:53,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:53,327 INFO L85 PathProgramCache]: Analyzing trace with hash 180228959, now seen corresponding path program 1 times [2022-02-20 17:28:53,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:53,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004472670] [2022-02-20 17:28:53,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:53,343 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:28:53,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808030708] [2022-02-20 17:28:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:53,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:53,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:53,351 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:28:53,354 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:28:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:53,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:28:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:53,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:53,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {115#true} is VALID [2022-02-20 17:28:53,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#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_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {123#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:28:53,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {123#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:28:53,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {123#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {123#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:28:53,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:28:53,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:53,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {116#false} is VALID [2022-02-20 17:28:53,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {116#false} assume !false; {116#false} is VALID [2022-02-20 17:28:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:28:53,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:28:53,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:53,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004472670] [2022-02-20 17:28:53,594 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:28:53,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808030708] [2022-02-20 17:28:53,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808030708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:53,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:53,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:28:53,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790707430] [2022-02-20 17:28:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:28:53,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:53,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:53,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:28:53,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:28:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:28:53,620 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:53,725 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 17:28:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:28:53,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:28:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 17:28:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 17:28:53,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-02-20 17:28:53,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:53,759 INFO L225 Difference]: With dead ends: 25 [2022-02-20 17:28:53,759 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:28:53,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:28:53,761 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:28:53,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:28:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-02-20 17:28:53,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:53,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:53,767 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:53,767 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:53,769 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:28:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:28:53,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:53,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:53,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:28:53,770 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:28:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:53,772 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:28:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:28:53,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:53,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:53,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:53,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 17:28:53,775 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 8 [2022-02-20 17:28:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:53,776 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 17:28:53,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 17:28:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:28:53,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:53,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:53,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:28:53,991 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:28:53,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1219556645, now seen corresponding path program 1 times [2022-02-20 17:28:53,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:53,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8810166] [2022-02-20 17:28:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:54,003 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:28:54,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944575270] [2022-02-20 17:28:54,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:54,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:54,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:54,010 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:28:54,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:28:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:54,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:28:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:54,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:54,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:54,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {256#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:54,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {263#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:28:54,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {263#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 10);havoc main_#t~post6#1; {252#false} is VALID [2022-02-20 17:28:54,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {252#false} main_~x~0#1 := main_~x~0#1 * ((main_~z~0#1 - 1) % 4294967296); {252#false} is VALID [2022-02-20 17:28:54,097 INFO L272 TraceCheckUtils]: 5: Hoare triple {252#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 - main_~y~0#1 then 1 else 0)); {252#false} is VALID [2022-02-20 17:28:54,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-02-20 17:28:54,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-02-20 17:28:54,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-02-20 17:28:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:28:54,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:28:54,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:54,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8810166] [2022-02-20 17:28:54,099 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:28:54,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944575270] [2022-02-20 17:28:54,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944575270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:54,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:54,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:28:54,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77627752] [2022-02-20 17:28:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:54,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:28:54,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:54,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:54,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:54,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:28:54,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:54,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:28:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:28:54,110 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:54,152 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:28:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:28:54,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:28:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-20 17:28:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-20 17:28:54,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-02-20 17:28:54,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:54,191 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:28:54,191 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:28:54,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:28:54,194 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:28:54,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:28:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:28:54,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:54,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:54,206 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:54,207 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:54,209 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:28:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:28:54,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:54,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:54,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:28:54,210 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:28:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:54,212 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:28:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:28:54,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:54,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:54,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:54,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:28:54,214 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 9 [2022-02-20 17:28:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:54,215 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:28:54,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:28:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:28:54,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:54,216 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:54,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:28:54,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:28:54,424 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1817042812, now seen corresponding path program 1 times [2022-02-20 17:28:54,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:54,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675538395] [2022-02-20 17:28:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:54,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:54,438 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:28:54,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721549845] [2022-02-20 17:28:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:54,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:54,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:54,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:28:54,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:28:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:28:54,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:28:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:28:54,498 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:28:54,498 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:28:54,499 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:28:54,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:28:54,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:54,717 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 17:28:54,719 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:28:54,728 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); [2022-02-20 17:28:54,728 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:28:54,731 INFO L158 Benchmark]: Toolchain (without parser) took 2479.75ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 64.4MB in the beginning and 48.4MB in the end (delta: 16.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,731 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:28:54,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.05ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 64.2MB in the beginning and 89.4MB in the end (delta: -25.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.37ms. Allocated memory is still 113.2MB. Free memory was 89.4MB in the beginning and 88.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:28:54,732 INFO L158 Benchmark]: Boogie Preprocessor took 16.31ms. Allocated memory is still 113.2MB. Free memory was 88.2MB in the beginning and 86.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,733 INFO L158 Benchmark]: RCFGBuilder took 221.64ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 77.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,733 INFO L158 Benchmark]: TraceAbstraction took 1981.89ms. Allocated memory is still 113.2MB. Free memory was 76.9MB in the beginning and 48.4MB in the end (delta: 28.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,735 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.05ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 64.2MB in the beginning and 89.4MB in the end (delta: -25.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.37ms. Allocated memory is still 113.2MB. Free memory was 89.4MB in the beginning and 88.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.31ms. Allocated memory is still 113.2MB. Free memory was 88.2MB in the beginning and 86.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 221.64ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 77.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1981.89ms. Allocated memory is still 113.2MB. Free memory was 76.9MB in the beginning and 48.4MB in the end (delta: 28.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:28:54,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/geo1-u_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 97bfd47a763eadf3b0af2f8e585b7163ffc0c68bcbafc8205f8cd9e774a99e69 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:28:56,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:28:56,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:28:56,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:28:56,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:28:56,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:28:56,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:28:56,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:28:56,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:28:56,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:28:56,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:28:56,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:28:56,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:28:56,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:28:56,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:28:56,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:28:56,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:28:56,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:28:56,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:28:56,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:28:56,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:28:56,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:28:56,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:28:56,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:28:56,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:28:56,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:28:56,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:28:56,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:28:56,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:28:56,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:28:56,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:28:56,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:28:56,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:28:56,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:28:56,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:28:56,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:28:56,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:28:56,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:28:56,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:28:56,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:28:56,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:28:56,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:28:56,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:28:56,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:28:56,830 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:28:56,830 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:28:56,831 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:28:56,831 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:28:56,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:28:56,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:28:56,833 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:28:56,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:28:56,834 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:28:56,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:28:56,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:28:56,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:28:56,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:28:56,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:28:56,835 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:28:56,835 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:28:56,835 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:28:56,835 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:28:56,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:28:56,836 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:28:56,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:28:56,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:28:56,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:28:56,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:28:56,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:28:56,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:28:56,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:28:56,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:28:56,837 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:28:56,837 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:28:56,838 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:28:56,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:28:56,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:28:56,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:28:56,839 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 97bfd47a763eadf3b0af2f8e585b7163ffc0c68bcbafc8205f8cd9e774a99e69 [2022-02-20 17:28:57,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:28:57,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:28:57,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:28:57,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:28:57,154 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:28:57,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u_unwindbound10.c [2022-02-20 17:28:57,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eaadc496/cfa1fa6a8e394917b984c1887e96e4ba/FLAG6f5eff08d [2022-02-20 17:28:57,643 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:28:57,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_unwindbound10.c [2022-02-20 17:28:57,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eaadc496/cfa1fa6a8e394917b984c1887e96e4ba/FLAG6f5eff08d [2022-02-20 17:28:57,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eaadc496/cfa1fa6a8e394917b984c1887e96e4ba [2022-02-20 17:28:57,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:28:57,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:28:57,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:28:57,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:28:57,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:28:57,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7053c4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57, skipping insertion in model container [2022-02-20 17:28:57,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:28:57,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:28:57,795 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/geo1-u_unwindbound10.c[555,568] [2022-02-20 17:28:57,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:28:57,818 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:28:57,870 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/geo1-u_unwindbound10.c[555,568] [2022-02-20 17:28:57,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:28:57,899 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:28:57,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57 WrapperNode [2022-02-20 17:28:57,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:28:57,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:28:57,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:28:57,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:28:57,905 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:28:57" (1/1) ... [2022-02-20 17:28:57,910 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:28:57" (1/1) ... [2022-02-20 17:28:57,927 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2022-02-20 17:28:57,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:28:57,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:28:57,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:28:57,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:28:57,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:28:57,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:28:57,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:28:57,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:28:57,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (1/1) ... [2022-02-20 17:28:57,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:28:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:57,980 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:28:58,000 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:28:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:28:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:28:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:28:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:28:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:28:58,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:28:58,072 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:28:58,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:28:58,344 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:28:58,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:28:58,350 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:28:58,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:58 BoogieIcfgContainer [2022-02-20 17:28:58,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:28:58,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:28:58,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:28:58,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:28:58,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:28:57" (1/3) ... [2022-02-20 17:28:58,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c997525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:28:58, skipping insertion in model container [2022-02-20 17:28:58,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:57" (2/3) ... [2022-02-20 17:28:58,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c997525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:28:58, skipping insertion in model container [2022-02-20 17:28:58,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:58" (3/3) ... [2022-02-20 17:28:58,368 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_unwindbound10.c [2022-02-20 17:28:58,374 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:28:58,374 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:28:58,464 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:28:58,477 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:28:58,477 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:28:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:28:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:28:58,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:58,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:58,504 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash 561702714, now seen corresponding path program 1 times [2022-02-20 17:28:58,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:28:58,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342789289] [2022-02-20 17:28:58,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:58,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:28:58,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:28:58,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:28:58,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:28:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:58,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:28:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:58,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:58,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {21#true} is VALID [2022-02-20 17:28:58,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#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_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {21#true} is VALID [2022-02-20 17:28:58,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-20 17:28:58,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} main_~x~0#1 := ~bvmul64(main_~x~0#1, ~zero_extendFrom32To64(~bvsub32(main_~z~0#1, 1bv32))); {22#false} is VALID [2022-02-20 17:28:58,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#false} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvadd64(1bv64, main_~x~0#1), main_~y~0#1) then 1bv32 else 0bv32)); {22#false} is VALID [2022-02-20 17:28:58,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-02-20 17:28:58,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume 0bv32 == ~cond; {22#false} is VALID [2022-02-20 17:28:58,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 17:28:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:28:58,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:28:58,717 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:28:58,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342789289] [2022-02-20 17:28:58,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342789289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:58,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:58,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:28:58,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990819324] [2022-02-20 17:28:58,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:58,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:28:58,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:58,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:58,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:58,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:28:58,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:28:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:28:58,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:28:58,792 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:59,045 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 17:28:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:28:59,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:28:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2022-02-20 17:28:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2022-02-20 17:28:59,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 44 transitions. [2022-02-20 17:28:59,353 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:28:59,359 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:28:59,360 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 17:28:59,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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:28:59,365 INFO L933 BasicCegarLoop]: 20 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, 20 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:28:59,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 17:28:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 17:28:59,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:59,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:28:59,404 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:28:59,404 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:28:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:59,407 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-20 17:28:59,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:28:59,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:59,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:59,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-02-20 17:28:59,408 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-02-20 17:28:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:59,410 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-20 17:28:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:28:59,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:59,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:59,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:59,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:28:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 17:28:59,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2022-02-20 17:28:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:59,415 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 17:28:59,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:28:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:28:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:28:59,416 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:59,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:59,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:28:59,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:28:59,628 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash 180228959, now seen corresponding path program 1 times [2022-02-20 17:28:59,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:28:59,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055386293] [2022-02-20 17:28:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:59,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:28:59,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:28:59,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:28:59,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:28:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:59,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:28:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:59,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:59,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {136#true} is VALID [2022-02-20 17:28:59,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#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_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {144#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:28:59,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {144#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:28:59,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {144#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} assume !!~bvslt32(main_#t~post6#1, 10bv32);havoc main_#t~post6#1; {144#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:28:59,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {144#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} call __VERIFIER_assert((if 0bv64 == ~bvadd64(1bv64, ~bvsub64(~bvsub64(~bvmul64(main_~x~0#1, ~zero_extendFrom32To64(main_~z~0#1)), main_~x~0#1), main_~y~0#1)) then 1bv32 else 0bv32)); {154#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:28:59,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {158#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:28:59,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {137#false} is VALID [2022-02-20 17:28:59,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-02-20 17:28:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:28:59,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:28:59,943 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:28:59,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055386293] [2022-02-20 17:28:59,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055386293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:59,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:59,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:28:59,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12195065] [2022-02-20 17:28:59,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:28:59,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:59,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:00,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:00,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:00,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:00,014 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:00,967 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 17:29:00,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:00,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 17:29:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 17:29:00,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-02-20 17:29:01,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:01,236 INFO L225 Difference]: With dead ends: 25 [2022-02-20 17:29:01,236 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:29:01,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:29:01,238 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:01,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:29:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:29:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-02-20 17:29:01,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:01,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:01,242 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:01,243 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:01,247 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:29:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:29:01,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:01,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:01,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:29:01,248 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:29:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:01,250 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:29:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:29:01,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:01,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:01,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:01,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 17:29:01,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 8 [2022-02-20 17:29:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:01,253 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 17:29:01,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 17:29:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:29:01,254 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:01,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:01,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:29:01,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:29:01,455 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1219556645, now seen corresponding path program 1 times [2022-02-20 17:29:01,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:01,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689238747] [2022-02-20 17:29:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:01,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:01,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:01,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:29:01,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:29:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:01,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:29:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:01,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:01,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {277#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:29:01,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#(= ~counter~0 (_ bv0 32))} 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_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {277#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:29:01,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {284#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} is VALID [2022-02-20 17:29:01,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {284#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 10bv32);havoc main_#t~post6#1; {273#false} is VALID [2022-02-20 17:29:01,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {273#false} main_~x~0#1 := ~bvmul64(main_~x~0#1, ~zero_extendFrom32To64(~bvsub32(main_~z~0#1, 1bv32))); {273#false} is VALID [2022-02-20 17:29:01,584 INFO L272 TraceCheckUtils]: 5: Hoare triple {273#false} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvadd64(1bv64, main_~x~0#1), main_~y~0#1) then 1bv32 else 0bv32)); {273#false} is VALID [2022-02-20 17:29:01,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {273#false} ~cond := #in~cond; {273#false} is VALID [2022-02-20 17:29:01,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#false} assume 0bv32 == ~cond; {273#false} is VALID [2022-02-20 17:29:01,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#false} assume !false; {273#false} is VALID [2022-02-20 17:29:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:01,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:01,586 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:01,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689238747] [2022-02-20 17:29:01,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689238747] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:01,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:01,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:29:01,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622883996] [2022-02-20 17:29:01,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:29:01,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:01,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:01,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:01,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:29:01,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:01,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:29:01,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:01,618 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:02,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:02,428 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:29:02,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:29:02,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:29:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-20 17:29:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-20 17:29:02,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-02-20 17:29:02,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:02,584 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:29:02,585 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:02,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:02,586 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:02,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:02,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:02,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:02,593 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:02,594 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:02,595 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:02,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:02,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:02,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:29:02,596 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:29:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:02,598 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:02,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:02,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:02,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:02,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:02,600 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 9 [2022-02-20 17:29:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:02,600 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:02,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:29:02,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:02,601 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:02,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 17:29:02,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:29:02,811 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:02,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1817042812, now seen corresponding path program 1 times [2022-02-20 17:29:02,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:02,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132876244] [2022-02-20 17:29:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:02,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:02,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:29:02,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 17:29:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:02,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:02,961 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 17:29:02,961 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:02,962 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:02,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:03,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:29:03,167 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 17:29:03,169 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:03,178 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0bv64 == ~bvadd64(1bv64, ~bvsub64(~bvsub64(~bvmul64(~x~0, ~zero_extendFrom32To64(~z~0)), ~x~0), ~y~0)) then 1bv32 else 0bv32)); [2022-02-20 17:29:03,179 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:29:03,182 INFO L158 Benchmark]: Toolchain (without parser) took 5518.78ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 47.8MB in the beginning and 60.5MB in the end (delta: -12.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:03,182 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 67.1MB. Free memory was 48.0MB in the beginning and 47.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:03,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.96ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 49.7MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:03,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.90ms. Allocated memory is still 67.1MB. Free memory was 49.7MB in the beginning and 48.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:03,183 INFO L158 Benchmark]: Boogie Preprocessor took 19.63ms. Allocated memory is still 67.1MB. Free memory was 48.1MB in the beginning and 46.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:03,184 INFO L158 Benchmark]: RCFGBuilder took 411.36ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 37.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:03,184 INFO L158 Benchmark]: TraceAbstraction took 4818.24ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 36.7MB in the beginning and 60.5MB in the end (delta: -23.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:03,186 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 67.1MB. Free memory was 48.0MB in the beginning and 47.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.96ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 49.7MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.90ms. Allocated memory is still 67.1MB. Free memory was 49.7MB in the beginning and 48.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.63ms. Allocated memory is still 67.1MB. Free memory was 48.1MB in the beginning and 46.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 411.36ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 37.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4818.24ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 36.7MB in the beginning and 60.5MB in the end (delta: -23.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:29:03,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator