./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound1.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/prodbin-ll_unwindbound1.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 0ed66a9708aeb6d05a44fe8a4cf62f1870d2d459d6d935309468ed731262ea37 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:39:22,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:39:22,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:39:22,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:39:22,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:39:22,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:39:22,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:39:22,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:39:22,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:39:22,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:39:22,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:39:22,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:39:22,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:39:22,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:39:22,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:39:22,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:39:22,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:39:22,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:39:22,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:39:22,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:39:22,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:39:22,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:39:22,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:39:22,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:39:22,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:39:22,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:39:22,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:39:22,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:39:22,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:39:22,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:39:22,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:39:22,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:39:22,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:39:22,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:39:22,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:39:22,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:39:22,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:39:22,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:39:22,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:39:22,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:39:22,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:39:22,711 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:39:22,744 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:39:22,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:39:22,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:39:22,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:39:22,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:39:22,746 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:39:22,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:39:22,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:39:22,747 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:39:22,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:39:22,748 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:39:22,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:39:22,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:39:22,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:39:22,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:39:22,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:39:22,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:39:22,749 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:39:22,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:39:22,749 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:39:22,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:39:22,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:39:22,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:39:22,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:39:22,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:22,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:39:22,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:39:22,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:39:22,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:39:22,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:39:22,752 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:39:22,752 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:39:22,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:39:22,753 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 -> 0ed66a9708aeb6d05a44fe8a4cf62f1870d2d459d6d935309468ed731262ea37 [2022-02-20 17:39:22,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:39:22,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:39:22,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:39:22,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:39:22,980 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:39:22,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound1.c [2022-02-20 17:39:23,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2796e98b4/c66b5f9742a7480ea3f5ae785d3679d5/FLAG9525471b5 [2022-02-20 17:39:23,433 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:39:23,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound1.c [2022-02-20 17:39:23,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2796e98b4/c66b5f9742a7480ea3f5ae785d3679d5/FLAG9525471b5 [2022-02-20 17:39:23,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2796e98b4/c66b5f9742a7480ea3f5ae785d3679d5 [2022-02-20 17:39:23,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:39:23,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:39:23,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:23,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:39:23,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:39:23,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:23" (1/1) ... [2022-02-20 17:39:23,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718214ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:23, skipping insertion in model container [2022-02-20 17:39:23,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:23" (1/1) ... [2022-02-20 17:39:23,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:39:23,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:39:23,988 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/prodbin-ll_unwindbound1.c[537,550] [2022-02-20 17:39:24,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:24,018 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:39:24,028 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/prodbin-ll_unwindbound1.c[537,550] [2022-02-20 17:39:24,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:24,049 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:39:24,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24 WrapperNode [2022-02-20 17:39:24,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:24,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:24,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:39:24,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:39:24,055 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:39:24" (1/1) ... [2022-02-20 17:39:24,060 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:39:24" (1/1) ... [2022-02-20 17:39:24,076 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-02-20 17:39:24,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:24,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:39:24,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:39:24,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:39:24,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (1/1) ... [2022-02-20 17:39:24,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (1/1) ... [2022-02-20 17:39:24,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (1/1) ... [2022-02-20 17:39:24,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (1/1) ... [2022-02-20 17:39:24,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (1/1) ... [2022-02-20 17:39:24,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (1/1) ... [2022-02-20 17:39:24,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (1/1) ... [2022-02-20 17:39:24,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:39:24,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:39:24,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:39:24,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:39:24,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (1/1) ... [2022-02-20 17:39:24,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:24,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:24,128 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:39:24,129 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:39:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:39:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:39:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:39:24,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:39:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:39:24,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:39:24,204 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:39:24,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:39:24,325 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:39:24,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:39:24,331 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:39:24,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:24 BoogieIcfgContainer [2022-02-20 17:39:24,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:39:24,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:39:24,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:39:24,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:39:24,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:39:23" (1/3) ... [2022-02-20 17:39:24,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6323485e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:24, skipping insertion in model container [2022-02-20 17:39:24,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:24" (2/3) ... [2022-02-20 17:39:24,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6323485e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:24, skipping insertion in model container [2022-02-20 17:39:24,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:24" (3/3) ... [2022-02-20 17:39:24,339 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound1.c [2022-02-20 17:39:24,344 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:39:24,344 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:39:24,416 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:39:24,421 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:39:24,421 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:39:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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:39:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:39:24,454 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:24,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:24,455 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:24,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:24,459 INFO L85 PathProgramCache]: Analyzing trace with hash -572597424, now seen corresponding path program 1 times [2022-02-20 17:39:24,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:24,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323934106] [2022-02-20 17:39:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:24,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24#true} is VALID [2022-02-20 17:39:24,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {24#true} is VALID [2022-02-20 17:39:24,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {25#false} is VALID [2022-02-20 17:39:24,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {25#false} is VALID [2022-02-20 17:39:24,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-02-20 17:39:24,617 INFO L272 TraceCheckUtils]: 5: Hoare triple {25#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {25#false} is VALID [2022-02-20 17:39:24,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-02-20 17:39:24,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-02-20 17:39:24,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 17:39:24,619 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:39:24,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:24,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323934106] [2022-02-20 17:39:24,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323934106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:24,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:24,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:39:24,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350342872] [2022-02-20 17:39:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:24,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:24,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:24,661 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:39:24,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:39:24,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:24,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:39:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:39:24,696 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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 4.0) internal successors, (8), 2 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:39:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:24,758 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-02-20 17:39:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:39:24,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:39:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:39:24,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2022-02-20 17:39:24,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:24,862 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:39:24,862 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:39:24,865 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:39:24,868 INFO L933 BasicCegarLoop]: 24 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, 24 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:39:24,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:39:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 17:39:24,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:24,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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:39:24,899 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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:39:24,900 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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:39:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:24,909 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:39:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:24,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:24,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:24,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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 17 states. [2022-02-20 17:39:24,912 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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 17 states. [2022-02-20 17:39:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:24,915 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:39:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:24,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:24,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:24,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:24,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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:39:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 17:39:24,921 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-02-20 17:39:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:24,921 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 17:39:24,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:39:24,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:24,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:24,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:39:24,924 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1986366499, now seen corresponding path program 1 times [2022-02-20 17:39:24,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:24,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771887526] [2022-02-20 17:39:24,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:25,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:25,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(= ~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_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:25,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:25,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:25,014 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {135#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:39:25,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {133#false} is VALID [2022-02-20 17:39:25,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {133#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {133#false} is VALID [2022-02-20 17:39:25,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#false} ~cond := #in~cond; {133#false} is VALID [2022-02-20 17:39:25,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#false} assume 0 == ~cond; {133#false} is VALID [2022-02-20 17:39:25,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-02-20 17:39:25,021 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:39:25,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:25,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771887526] [2022-02-20 17:39:25,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771887526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:25,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:25,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:39:25,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238935594] [2022-02-20 17:39:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:25,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:25,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:25,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:25,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:39:25,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:25,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:39:25,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:39:25,039 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:25,094 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 17:39:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:39:25,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 17:39:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 17:39:25,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-02-20 17:39:25,126 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:39:25,127 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:39:25,127 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:39:25,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:39:25,134 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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:39:25,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:39:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:39:25,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:25,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:39:25,140 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:39:25,141 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:39:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:25,143 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 17:39:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:25,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:25,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:25,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 19 states. [2022-02-20 17:39:25,145 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 19 states. [2022-02-20 17:39:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:25,148 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 17:39:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:25,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:25,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:25,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:25,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:39:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-20 17:39:25,151 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2022-02-20 17:39:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:25,152 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-20 17:39:25,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:39:25,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:25,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:25,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:39:25,154 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:25,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1984579039, now seen corresponding path program 1 times [2022-02-20 17:39:25,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:25,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023302095] [2022-02-20 17:39:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:25,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:25,177 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:25,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769975665] [2022-02-20 17:39:25,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:25,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:25,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:25,180 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:39:25,181 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:39:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:25,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:39:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:25,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:25,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {233#true} is VALID [2022-02-20 17:39:25,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {233#true} is VALID [2022-02-20 17:39:25,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {233#true} assume !(0 == assume_abort_if_not_~cond#1); {233#true} is VALID [2022-02-20 17:39:25,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {233#true} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:25,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:25,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:25,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:25,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:25,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {234#false} is VALID [2022-02-20 17:39:25,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 17:39:25,363 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:39:25,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:25,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:25,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023302095] [2022-02-20 17:39:25,364 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:25,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769975665] [2022-02-20 17:39:25,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769975665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:25,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:25,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:25,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313978414] [2022-02-20 17:39:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:25,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:25,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:25,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:25,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:25,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:25,375 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:25,479 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 17:39:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:39:25,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:25,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 17:39:25,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:25,513 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:39:25,513 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:39:25,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:39:25,514 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:25,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:39:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-02-20 17:39:25,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:25,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:25,519 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:25,520 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:25,521 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:39:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 17:39:25,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:25,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:25,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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 28 states. [2022-02-20 17:39:25,522 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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 28 states. [2022-02-20 17:39:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:25,524 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:39:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 17:39:25,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:25,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:25,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:25,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:39:25,527 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-02-20 17:39:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:25,527 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:39:25,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:39:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:39:25,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:25,528 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:25,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:39:25,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:25,744 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 845350648, now seen corresponding path program 1 times [2022-02-20 17:39:25,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:25,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357648876] [2022-02-20 17:39:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:25,761 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:25,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438386309] [2022-02-20 17:39:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:25,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:25,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:25,767 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:39:25,768 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:39:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:25,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:39:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:25,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:25,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {394#true} is VALID [2022-02-20 17:39:25,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {402#(or (and (not (<= 1 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:39:25,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(or (and (not (<= 1 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|)))} assume !(0 == assume_abort_if_not_~cond#1); {406#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:39:25,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {406#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:25,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:25,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:25,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {394#true} is VALID [2022-02-20 17:39:25,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#true} ~cond := #in~cond; {394#true} is VALID [2022-02-20 17:39:25,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#true} assume !(0 == ~cond); {394#true} is VALID [2022-02-20 17:39:25,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 17:39:25,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {394#true} {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} #53#return; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:25,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(0 != main_~y~0#1); {395#false} is VALID [2022-02-20 17:39:25,943 INFO L272 TraceCheckUtils]: 12: Hoare triple {395#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {395#false} is VALID [2022-02-20 17:39:25,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {395#false} ~cond := #in~cond; {395#false} is VALID [2022-02-20 17:39:25,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} assume 0 == ~cond; {395#false} is VALID [2022-02-20 17:39:25,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-02-20 17:39:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:25,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:25,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:25,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357648876] [2022-02-20 17:39:25,945 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:25,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438386309] [2022-02-20 17:39:25,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438386309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:25,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:25,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:25,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028427123] [2022-02-20 17:39:25,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:25,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:39:25,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:25,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:25,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:25,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:25,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:25,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:25,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:25,962 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:26,084 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-20 17:39:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:39:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:39:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:26,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 17:39:26,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:26,117 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:39:26,117 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:39:26,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:39:26,118 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:26,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:39:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-20 17:39:26,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:26,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:26,127 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:26,127 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:26,128 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 17:39:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 17:39:26,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:26,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:26,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-02-20 17:39:26,130 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-02-20 17:39:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:26,131 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 17:39:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 17:39:26,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:26,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:26,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:26,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-02-20 17:39:26,133 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-02-20 17:39:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:26,134 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-20 17:39:26,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 17:39:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:39:26,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:26,135 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:26,164 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:39:26,348 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,SelfDestructingSolverStorable3 [2022-02-20 17:39:26,348 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash 905454657, now seen corresponding path program 1 times [2022-02-20 17:39:26,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:26,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612488718] [2022-02-20 17:39:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:26,366 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:26,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148114628] [2022-02-20 17:39:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:26,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:26,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:26,369 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:39:26,383 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:39:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:39:26,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:39:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:39:26,431 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:39:26,432 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:39:26,433 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:39:26,462 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:39:26,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:26,654 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:39:26,656 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:39:26,666 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); [2022-02-20 17:39:26,667 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:39:26,670 INFO L158 Benchmark]: Toolchain (without parser) took 2815.63ms. Allocated memory is still 121.6MB. Free memory was 89.6MB in the beginning and 81.1MB in the end (delta: 8.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-20 17:39:26,670 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:39:26,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.82ms. Allocated memory is still 121.6MB. Free memory was 89.3MB in the beginning and 79.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:39:26,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.52ms. Allocated memory is still 121.6MB. Free memory was 79.0MB in the beginning and 77.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:39:26,671 INFO L158 Benchmark]: Boogie Preprocessor took 15.76ms. Allocated memory is still 121.6MB. Free memory was 77.3MB in the beginning and 76.3MB in the end (delta: 964.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:39:26,671 INFO L158 Benchmark]: RCFGBuilder took 239.77ms. Allocated memory is still 121.6MB. Free memory was 76.2MB in the beginning and 65.5MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:39:26,671 INFO L158 Benchmark]: TraceAbstraction took 2334.69ms. Allocated memory is still 121.6MB. Free memory was 65.0MB in the beginning and 81.1MB in the end (delta: -16.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:39:26,673 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.18ms. Allocated memory is still 83.9MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.82ms. Allocated memory is still 121.6MB. Free memory was 89.3MB in the beginning and 79.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.52ms. Allocated memory is still 121.6MB. Free memory was 79.0MB in the beginning and 77.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.76ms. Allocated memory is still 121.6MB. Free memory was 77.3MB in the beginning and 76.3MB in the end (delta: 964.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 239.77ms. Allocated memory is still 121.6MB. Free memory was 76.2MB in the beginning and 65.5MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2334.69ms. Allocated memory is still 121.6MB. Free memory was 65.0MB in the beginning and 81.1MB in the end (delta: -16.1MB). 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:39:26,700 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/prodbin-ll_unwindbound1.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 0ed66a9708aeb6d05a44fe8a4cf62f1870d2d459d6d935309468ed731262ea37 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:39:28,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:39:28,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:39:28,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:39:28,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:39:28,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:39:28,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:39:28,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:39:28,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:39:28,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:39:28,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:39:28,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:39:28,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:39:28,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:39:28,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:39:28,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:39:28,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:39:28,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:39:28,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:39:28,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:39:28,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:39:28,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:39:28,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:39:28,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:39:28,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:39:28,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:39:28,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:39:28,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:39:28,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:39:28,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:39:28,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:39:28,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:39:28,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:39:28,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:39:28,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:39:28,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:39:28,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:39:28,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:39:28,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:39:28,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:39:28,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:39:28,652 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:39:28,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:39:28,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:39:28,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:39:28,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:39:28,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:39:28,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:39:28,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:39:28,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:39:28,688 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:39:28,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:39:28,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:39:28,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:39:28,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:39:28,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:39:28,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:39:28,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:39:28,690 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:39:28,690 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:39:28,690 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:39:28,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:39:28,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:39:28,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:39:28,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:39:28,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:39:28,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:39:28,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:39:28,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:28,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:39:28,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:39:28,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:39:28,700 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:39:28,700 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:39:28,701 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:39:28,701 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:39:28,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:39:28,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:39:28,701 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 -> 0ed66a9708aeb6d05a44fe8a4cf62f1870d2d459d6d935309468ed731262ea37 [2022-02-20 17:39:28,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:39:28,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:39:28,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:39:28,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:39:28,984 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:39:28,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound1.c [2022-02-20 17:39:29,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3978fc6d0/580c1b7f085b477a9e3a36437326ed04/FLAG14cfd9fdd [2022-02-20 17:39:29,368 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:39:29,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound1.c [2022-02-20 17:39:29,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3978fc6d0/580c1b7f085b477a9e3a36437326ed04/FLAG14cfd9fdd [2022-02-20 17:39:29,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3978fc6d0/580c1b7f085b477a9e3a36437326ed04 [2022-02-20 17:39:29,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:39:29,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:39:29,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:29,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:39:29,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:39:29,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:29" (1/1) ... [2022-02-20 17:39:29,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35281e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:29, skipping insertion in model container [2022-02-20 17:39:29,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:29" (1/1) ... [2022-02-20 17:39:29,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:39:29,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:39:29,985 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/prodbin-ll_unwindbound1.c[537,550] [2022-02-20 17:39:29,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:30,006 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:39:30,019 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/prodbin-ll_unwindbound1.c[537,550] [2022-02-20 17:39:30,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:30,047 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:39:30,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30 WrapperNode [2022-02-20 17:39:30,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:30,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:30,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:39:30,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:39:30,056 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:39:30" (1/1) ... [2022-02-20 17:39:30,069 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:39:30" (1/1) ... [2022-02-20 17:39:30,093 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2022-02-20 17:39:30,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:30,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:39:30,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:39:30,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:39:30,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (1/1) ... [2022-02-20 17:39:30,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (1/1) ... [2022-02-20 17:39:30,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (1/1) ... [2022-02-20 17:39:30,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (1/1) ... [2022-02-20 17:39:30,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (1/1) ... [2022-02-20 17:39:30,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (1/1) ... [2022-02-20 17:39:30,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (1/1) ... [2022-02-20 17:39:30,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:39:30,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:39:30,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:39:30,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:39:30,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (1/1) ... [2022-02-20 17:39:30,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:30,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:30,168 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:39:30,190 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:39:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:39:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:39:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:39:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:39:30,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:39:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:39:30,270 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:39:30,272 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:39:30,527 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:39:30,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:39:30,547 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:39:30,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:30 BoogieIcfgContainer [2022-02-20 17:39:30,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:39:30,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:39:30,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:39:30,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:39:30,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:39:29" (1/3) ... [2022-02-20 17:39:30,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3b86ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:30, skipping insertion in model container [2022-02-20 17:39:30,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:30" (2/3) ... [2022-02-20 17:39:30,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3b86ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:30, skipping insertion in model container [2022-02-20 17:39:30,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:30" (3/3) ... [2022-02-20 17:39:30,554 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound1.c [2022-02-20 17:39:30,573 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:39:30,574 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:39:30,632 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:39:30,647 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:39:30,648 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:39:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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:39:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:39:30,666 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:30,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:30,668 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash -572597424, now seen corresponding path program 1 times [2022-02-20 17:39:30,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:39:30,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311362638] [2022-02-20 17:39:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:30,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:39:30,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:39:30,695 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:39:30,766 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:39:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:30,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:39:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:30,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:30,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {24#true} is VALID [2022-02-20 17:39:30,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsge32(main_~b~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {24#true} is VALID [2022-02-20 17:39:30,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {25#false} is VALID [2022-02-20 17:39:30,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := ~sign_extendFrom32To64(main_~a~0#1);main_~y~0#1 := ~sign_extendFrom32To64(main_~b~0#1);main_~z~0#1 := 0bv64; {25#false} is VALID [2022-02-20 17:39:30,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-02-20 17:39:30,907 INFO L272 TraceCheckUtils]: 5: Hoare triple {25#false} call __VERIFIER_assert((if main_~z~0#1 == ~bvmul64(~sign_extendFrom32To64(main_~a~0#1), ~sign_extendFrom32To64(main_~b~0#1)) then 1bv32 else 0bv32)); {25#false} is VALID [2022-02-20 17:39:30,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-02-20 17:39:30,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2022-02-20 17:39:30,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 17:39:30,909 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:39:30,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:30,911 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:39:30,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311362638] [2022-02-20 17:39:30,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311362638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:30,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:30,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:39:30,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40330672] [2022-02-20 17:39:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:30,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:30,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:30,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:30,960 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:39:30,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:39:30,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:39:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:39:30,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:39:30,985 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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 4.0) internal successors, (8), 2 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:39:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:31,639 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-02-20 17:39:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:39:31,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:39:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:39:31,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2022-02-20 17:39:32,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:32,167 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:39:32,168 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:39:32,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:39:32,173 INFO L933 BasicCegarLoop]: 24 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, 24 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:39:32,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:39:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 17:39:32,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:32,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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:39:32,200 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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:39:32,200 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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:39:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:32,203 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:39:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:32,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:32,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:32,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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 17 states. [2022-02-20 17:39:32,205 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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 17 states. [2022-02-20 17:39:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:32,207 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:39:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:32,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:32,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:32,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:32,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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:39:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 17:39:32,212 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-02-20 17:39:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:32,212 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 17:39:32,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:39:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:39:32,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:32,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:32,231 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:39:32,425 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:39:32,426 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1986366499, now seen corresponding path program 1 times [2022-02-20 17:39:32,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:39:32,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851082961] [2022-02-20 17:39:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:32,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:39:32,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:39:32,431 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:39:32,432 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:39:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:32,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:39:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:32,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:32,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#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(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {161#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:39:32,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#(= ~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_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsge32(main_~b~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {161#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:39:32,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond#1); {161#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:39:32,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {161#(= ~counter~0 (_ bv0 32))} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := ~sign_extendFrom32To64(main_~a~0#1);main_~y~0#1 := ~sign_extendFrom32To64(main_~b~0#1);main_~z~0#1 := 0bv64; {161#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:39:32,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {161#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {174#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} is VALID [2022-02-20 17:39:32,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {174#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {157#false} is VALID [2022-02-20 17:39:32,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {157#false} call __VERIFIER_assert((if main_~z~0#1 == ~bvmul64(~sign_extendFrom32To64(main_~a~0#1), ~sign_extendFrom32To64(main_~b~0#1)) then 1bv32 else 0bv32)); {157#false} is VALID [2022-02-20 17:39:32,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-02-20 17:39:32,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#false} assume 0bv32 == ~cond; {157#false} is VALID [2022-02-20 17:39:32,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-02-20 17:39:32,573 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:39:32,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:32,574 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:39:32,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851082961] [2022-02-20 17:39:32,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851082961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:32,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:32,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:39:32,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741420626] [2022-02-20 17:39:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:32,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:32,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:32,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:32,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:39:32,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:39:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:39:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:39:32,629 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:33,894 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 17:39:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:39:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 17:39:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 17:39:33,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-02-20 17:39:34,107 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:39:34,108 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:39:34,108 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:39:34,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:39:34,110 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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:39:34,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:39:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:39:34,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:34,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:39:34,114 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:39:34,114 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:39:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,116 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 17:39:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:34,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:34,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:34,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 19 states. [2022-02-20 17:39:34,117 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 19 states. [2022-02-20 17:39:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:34,119 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 17:39:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:34,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:34,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:34,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:34,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:39:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-20 17:39:34,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2022-02-20 17:39:34,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:34,122 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-20 17:39:34,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:39:34,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:34,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:34,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:39:34,327 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:39:34,327 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:34,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1984579039, now seen corresponding path program 1 times [2022-02-20 17:39:34,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:39:34,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617642898] [2022-02-20 17:39:34,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:34,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:39:34,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:39:34,334 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:39:34,337 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:39:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:34,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:39:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:34,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:34,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {284#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(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {284#true} is VALID [2022-02-20 17:39:34,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsge32(main_~b~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {284#true} is VALID [2022-02-20 17:39:34,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {284#true} is VALID [2022-02-20 17:39:34,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {284#true} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := ~sign_extendFrom32To64(main_~a~0#1);main_~y~0#1 := ~sign_extendFrom32To64(main_~b~0#1);main_~z~0#1 := 0bv64; {298#(and (= |ULTIMATE.start_main_~x~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (= (_ bv0 64) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:39:34,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {298#(and (= |ULTIMATE.start_main_~x~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (= (_ bv0 64) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {298#(and (= |ULTIMATE.start_main_~x~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (= (_ bv0 64) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:39:34,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {298#(and (= |ULTIMATE.start_main_~x~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (= (_ bv0 64) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {298#(and (= |ULTIMATE.start_main_~x~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (= (_ bv0 64) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:39:34,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {298#(and (= |ULTIMATE.start_main_~x~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (= (_ bv0 64) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)))} call __VERIFIER_assert((if ~bvadd64(main_~z~0#1, ~bvmul64(main_~x~0#1, main_~y~0#1)) == ~bvmul64(~sign_extendFrom32To64(main_~a~0#1), ~sign_extendFrom32To64(main_~b~0#1)) then 1bv32 else 0bv32)); {308#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:34,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {312#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:39:34,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {285#false} is VALID [2022-02-20 17:39:34,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#false} assume !false; {285#false} is VALID [2022-02-20 17:39:34,928 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:39:34,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:34,928 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:39:34,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617642898] [2022-02-20 17:39:34,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617642898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:34,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:34,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:34,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049544179] [2022-02-20 17:39:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:34,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:34,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:34,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:36,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 9 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:36,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:36,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:39:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:36,998 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:39,526 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 17:39:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:39:39,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:39,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 17:39:41,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:41,889 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:39:41,889 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:39:41,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:39:41,890 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:41,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 17:39:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:39:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-02-20 17:39:41,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:41,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:41,899 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:41,899 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:41,901 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:39:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 17:39:41,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:41,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:41,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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 28 states. [2022-02-20 17:39:41,903 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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 28 states. [2022-02-20 17:39:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:41,905 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:39:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 17:39:41,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:41,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:41,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:41,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:39:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:39:41,907 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-02-20 17:39:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:41,908 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:39:41,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:39:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:39:41,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:41,909 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:41,924 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:39:42,125 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:39:42,126 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 845350648, now seen corresponding path program 1 times [2022-02-20 17:39:42,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:39:42,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208326624] [2022-02-20 17:39:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:42,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:39:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:39:42,129 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:39:42,131 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:39:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:42,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:39:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:42,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:42,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {445#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(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {445#true} is VALID [2022-02-20 17:39:42,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsge32(main_~b~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {453#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32)))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:39:42,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32)))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} assume !(0bv32 == assume_abort_if_not_~cond#1); {457#(bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))} is VALID [2022-02-20 17:39:42,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {457#(bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := ~sign_extendFrom32To64(main_~a~0#1);main_~y~0#1 := ~sign_extendFrom32To64(main_~b~0#1);main_~z~0#1 := 0bv64; {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:39:42,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:39:42,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:39:42,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} call __VERIFIER_assert((if ~bvadd64(main_~z~0#1, ~bvmul64(main_~x~0#1, main_~y~0#1)) == ~bvmul64(~sign_extendFrom32To64(main_~a~0#1), ~sign_extendFrom32To64(main_~b~0#1)) then 1bv32 else 0bv32)); {445#true} is VALID [2022-02-20 17:39:42,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:39:42,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#true} assume !(0bv32 == ~cond); {445#true} is VALID [2022-02-20 17:39:42,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:39:42,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {445#true} {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} #53#return; {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:39:42,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {461#(exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))))} assume !(0bv64 != main_~y~0#1); {446#false} is VALID [2022-02-20 17:39:42,435 INFO L272 TraceCheckUtils]: 12: Hoare triple {446#false} call __VERIFIER_assert((if main_~z~0#1 == ~bvmul64(~sign_extendFrom32To64(main_~a~0#1), ~sign_extendFrom32To64(main_~b~0#1)) then 1bv32 else 0bv32)); {446#false} is VALID [2022-02-20 17:39:42,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#false} ~cond := #in~cond; {446#false} is VALID [2022-02-20 17:39:42,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {446#false} assume 0bv32 == ~cond; {446#false} is VALID [2022-02-20 17:39:42,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-02-20 17:39:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:42,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:42,437 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:39:42,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208326624] [2022-02-20 17:39:42,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208326624] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:42,437 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:42,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:42,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105186249] [2022-02-20 17:39:42,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:39:42,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:42,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:42,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:42,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:42,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:39:42,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:42,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:42,543 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:44,026 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:39:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:39:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:39:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 17:39:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 17:39:44,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-02-20 17:39:44,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:44,261 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:39:44,261 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 17:39:44,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:39:44,262 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:44,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-02-20 17:39:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 17:39:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 17:39:44,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:44,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:44,267 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:44,267 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:44,269 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 17:39:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 17:39:44,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:44,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:44,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 17:39:44,270 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 17:39:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:44,272 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 17:39:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 17:39:44,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:44,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:44,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:44,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-02-20 17:39:44,274 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-02-20 17:39:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:44,275 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-20 17:39:44,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 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:39:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 17:39:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:39:44,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:44,276 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:44,289 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:39:44,483 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:39:44,483 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash 905454657, now seen corresponding path program 1 times [2022-02-20 17:39:44,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:39:44,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479897082] [2022-02-20 17:39:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:44,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:39:44,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:39:44,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:39:44,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 17:39:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:39:44,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:39:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:39:44,775 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 17:39:44,775 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:39:44,776 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:39:44,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:39:44,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:39:44,980 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:39:44,982 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:39:44,992 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if ~bvadd64(~z~0, ~bvmul64(~x~0, ~y~0)) == ~bvmul64(~sign_extendFrom32To64(~a~0), ~sign_extendFrom32To64(~b~0)) then 1bv32 else 0bv32)); [2022-02-20 17:39:44,993 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:39:44,998 INFO L158 Benchmark]: Toolchain (without parser) took 15179.53ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.5MB in the beginning and 33.2MB in the end (delta: -3.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-20 17:39:44,999 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:39:44,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.13ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.3MB in the beginning and 49.9MB in the end (delta: -20.6MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-02-20 17:39:44,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 67.1MB. Free memory was 49.8MB in the beginning and 48.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:39:45,000 INFO L158 Benchmark]: Boogie Preprocessor took 41.31ms. Allocated memory is still 67.1MB. Free memory was 48.2MB in the beginning and 46.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:39:45,000 INFO L158 Benchmark]: RCFGBuilder took 412.84ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 37.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:39:45,002 INFO L158 Benchmark]: TraceAbstraction took 14447.41ms. Allocated memory is still 67.1MB. Free memory was 36.6MB in the beginning and 33.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:39:45,004 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.16ms. Allocated memory is still 52.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.13ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.3MB in the beginning and 49.9MB in the end (delta: -20.6MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 67.1MB. Free memory was 49.8MB in the beginning and 48.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.31ms. Allocated memory is still 67.1MB. Free memory was 48.2MB in the beginning and 46.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.84ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 37.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14447.41ms. Allocated memory is still 67.1MB. Free memory was 36.6MB in the beginning and 33.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. 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:39:45,050 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