./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo3-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/geo3-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 91c207b4b9ec9497b682edea4de56d410c70b882e6c03e91b56844bba1af20ff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:26,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:26,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:26,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:26,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:26,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:26,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:26,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:26,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:26,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:26,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:26,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:26,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:26,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:26,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:26,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:26,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:26,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:26,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:26,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:26,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:26,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:26,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:26,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:26,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:26,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:26,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:26,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:26,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:26,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:26,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:26,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:26,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:26,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:26,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:26,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:26,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:26,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:26,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:26,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:26,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:26,219 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:29:26,253 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:26,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:26,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:26,254 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:26,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:26,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:26,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:26,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:26,256 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:26,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:26,257 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:26,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:26,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:26,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:26,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:26,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:26,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:26,259 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:26,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:26,259 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:26,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:26,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:26,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:26,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:26,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:26,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:26,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:26,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:26,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:26,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:26,262 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:26,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:26,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:26,263 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 -> 91c207b4b9ec9497b682edea4de56d410c70b882e6c03e91b56844bba1af20ff [2022-02-20 17:29:26,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:26,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:26,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:26,546 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:26,546 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:26,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound1.c [2022-02-20 17:29:26,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc868279/9ad4e32c7e7a41e791e4355b52ad42a4/FLAG170887464 [2022-02-20 17:29:27,030 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:27,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound1.c [2022-02-20 17:29:27,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc868279/9ad4e32c7e7a41e791e4355b52ad42a4/FLAG170887464 [2022-02-20 17:29:27,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc868279/9ad4e32c7e7a41e791e4355b52ad42a4 [2022-02-20 17:29:27,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:27,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:27,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:27,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:27,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:27,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2bddaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27, skipping insertion in model container [2022-02-20 17:29:27,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:27,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:27,630 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/geo3-ll_unwindbound1.c[525,538] [2022-02-20 17:29:27,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:27,658 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:27,670 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/geo3-ll_unwindbound1.c[525,538] [2022-02-20 17:29:27,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:27,684 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:27,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27 WrapperNode [2022-02-20 17:29:27,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:27,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:27,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:27,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:27,690 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:29:27" (1/1) ... [2022-02-20 17:29:27,695 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:29:27" (1/1) ... [2022-02-20 17:29:27,715 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2022-02-20 17:29:27,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:27,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:27,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:27,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:27,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:27,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:27,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:27,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:27,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (1/1) ... [2022-02-20 17:29:27,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:27,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:27,764 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:29:27,771 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:29:27,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:27,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:27,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:27,846 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:27,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:27,963 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:27,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:27,970 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:27,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:27 BoogieIcfgContainer [2022-02-20 17:29:27,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:27,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:27,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:27,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:27,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:27" (1/3) ... [2022-02-20 17:29:27,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3689c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:27, skipping insertion in model container [2022-02-20 17:29:27,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:27" (2/3) ... [2022-02-20 17:29:27,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3689c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:27, skipping insertion in model container [2022-02-20 17:29:27,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:27" (3/3) ... [2022-02-20 17:29:27,979 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound1.c [2022-02-20 17:29:27,983 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:27,983 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:28,023 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:28,029 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:29:28,029 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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:29:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:29:28,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:28,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:28,052 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:28,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-02-20 17:29:28,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:28,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496709050] [2022-02-20 17:29:28,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:28,173 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:28,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715367405] [2022-02-20 17:29:28,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:28,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:28,176 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:29:28,178 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:29:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:28,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:29:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:28,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:28,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20#true} is VALID [2022-02-20 17:29:28,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#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~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {20#true} is VALID [2022-02-20 17:29:28,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-20 17:29:28,303 INFO L272 TraceCheckUtils]: 3: Hoare triple {21#false} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {21#false} is VALID [2022-02-20 17:29:28,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2022-02-20 17:29:28,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2022-02-20 17:29:28,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 17:29:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:28,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:28,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:28,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496709050] [2022-02-20 17:29:28,305 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:28,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715367405] [2022-02-20 17:29:28,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715367405] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:28,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:28,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:28,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465966152] [2022-02-20 17:29:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:28,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:29:28,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:28,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:28,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:28,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:28,354 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:28,393 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 17:29:28,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:28,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:29:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:29:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:29:28,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2022-02-20 17:29:28,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:28,470 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:29:28,470 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 17:29:28,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:29:28,476 INFO L933 BasicCegarLoop]: 19 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, 19 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:29:28,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 17:29:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 17:29:28,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:28,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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:29:28,511 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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:29:28,512 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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:29:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:28,515 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:29:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:28,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:28,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:28,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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 13 states. [2022-02-20 17:29:28,517 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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 13 states. [2022-02-20 17:29:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:28,520 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:29:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:28,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:28,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:28,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:28,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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:29:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 17:29:28,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-02-20 17:29:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:28,525 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 17:29:28,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:29:28,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:28,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:28,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:29:28,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 17:29:28,727 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-02-20 17:29:28,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:28,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734025715] [2022-02-20 17:29:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:28,742 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:28,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354368431] [2022-02-20 17:29:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:28,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:28,745 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:29:28,747 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:29:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:28,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:29:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:28,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:28,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {132#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:28,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#(<= ~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~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {132#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:28,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#(<= ~counter~0 0)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {139#(<= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-20 17:29:28,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#(<= |ULTIMATE.start_main_#t~post7#1| 0)} assume !(main_#t~post7#1 < 1);havoc main_#t~post7#1; {128#false} is VALID [2022-02-20 17:29:28,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#false} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {128#false} is VALID [2022-02-20 17:29:28,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#false} ~cond := #in~cond; {128#false} is VALID [2022-02-20 17:29:28,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#false} assume 0 == ~cond; {128#false} is VALID [2022-02-20 17:29:28,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-02-20 17:29:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:28,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:28,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:28,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734025715] [2022-02-20 17:29:28,880 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:28,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354368431] [2022-02-20 17:29:28,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354368431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:28,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:28,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:29:28,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517696432] [2022-02-20 17:29:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:28,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:28,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:28,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:28,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:29:28,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:28,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:29:28,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:28,897 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:28,958 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:29:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:29:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:29:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:29:28,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 17:29:28,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:28,990 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:29:28,992 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:29:28,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:28,994 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:28,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:29:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:29:29,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:29,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:29:29,003 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:29:29,004 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:29:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:29,008 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:29:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:29,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:29,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:29,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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 15 states. [2022-02-20 17:29:29,010 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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 15 states. [2022-02-20 17:29:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:29,012 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:29:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:29,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:29,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:29,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:29,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:29:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:29:29,017 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-02-20 17:29:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:29,018 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:29:29,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:29:29,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:29,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:29,051 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:29:29,235 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,SelfDestructingSolverStorable1 [2022-02-20 17:29:29,236 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-02-20 17:29:29,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:29,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404662525] [2022-02-20 17:29:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:29,248 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:29,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536656764] [2022-02-20 17:29:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:29,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:29,258 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:29:29,270 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:29:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:29,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:29:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:29,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:29,477 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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {233#true} is VALID [2022-02-20 17:29:29,478 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~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:29,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:29,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !!(main_#t~post7#1 < 1);havoc main_#t~post7#1; {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:29,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {251#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:29,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {255#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:29,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {234#false} is VALID [2022-02-20 17:29:29,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 17:29:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:29,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:29,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:29,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404662525] [2022-02-20 17:29:29,483 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:29,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536656764] [2022-02-20 17:29:29,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536656764] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:29,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:29,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:29,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721858215] [2022-02-20 17:29:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:29,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:29,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:29,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:29,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:29,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:29,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:29,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:29,495 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:29,590 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:29:29,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:29,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-20 17:29:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-20 17:29:29,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-02-20 17:29:29,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:29,625 INFO L225 Difference]: With dead ends: 24 [2022-02-20 17:29:29,626 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:29,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:29:29,627 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:29,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:29,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:29,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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:29:29,633 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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:29:29,634 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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:29:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:29,635 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:29,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:29,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:29,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 21 states. [2022-02-20 17:29:29,637 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 21 states. [2022-02-20 17:29:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:29,639 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:29,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:29,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:29,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:29,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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:29:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:29,641 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2022-02-20 17:29:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:29,642 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:29,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:29:29,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:29,643 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:29,670 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:29:29,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:29,868 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1542398814, now seen corresponding path program 1 times [2022-02-20 17:29:29,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:29,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932549837] [2022-02-20 17:29:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:29,886 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:29,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302128448] [2022-02-20 17:29:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:29,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:29,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:29,889 INFO L229 MonitoredProcess]: Starting monitored process 5 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:29:29,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:29:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:29,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:29:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:29,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:30,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {365#true} is VALID [2022-02-20 17:29:30,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#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~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {373#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:29:30,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {373#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {373#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:29:30,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {373#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post7#1 < 1);havoc main_#t~post7#1; {373#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:29:30,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {373#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:29:30,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} ~cond := #in~cond; {386#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:30,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:30,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:30,198 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} {373#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} #39#return; {397#(and (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:29:30,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(and (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := main_~x~0#1 * main_~z~0#1 + main_~a~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {401#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:29:30,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {401#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {401#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:29:30,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {401#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} assume !(main_#t~post7#1 < 1);havoc main_#t~post7#1; {401#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:29:30,206 INFO L272 TraceCheckUtils]: 12: Hoare triple {401#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:30,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:30,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:29:30,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:29:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:30,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:45,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:29:45,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:29:45,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:45,008 INFO L272 TraceCheckUtils]: 12: Hoare triple {431#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:45,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !(main_#t~post7#1 < 1);havoc main_#t~post7#1; {431#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:45,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {431#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:45,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {441#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~az~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~a~0#1| (* (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~z~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := main_~x~0#1 * main_~z~0#1 + main_~a~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {431#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:45,034 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} {365#true} #39#return; {441#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~az~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~a~0#1| (* (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:45,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:45,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {454#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:45,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} ~cond := #in~cond; {454#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:29:45,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:29:45,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} assume !!(main_#t~post7#1 < 1);havoc main_#t~post7#1; {365#true} is VALID [2022-02-20 17:29:45,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {365#true} is VALID [2022-02-20 17:29:45,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#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~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {365#true} is VALID [2022-02-20 17:29:45,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {365#true} is VALID [2022-02-20 17:29:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:45,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:45,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932549837] [2022-02-20 17:29:45,037 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:45,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302128448] [2022-02-20 17:29:45,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302128448] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:45,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:45,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-02-20 17:29:45,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527709617] [2022-02-20 17:29:45,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:45,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:29:45,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:45,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:45,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:45,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:29:45,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:45,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:29:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:29:45,153 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:46,417 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 17:29:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:29:46,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:29:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 17:29:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 17:29:46,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-02-20 17:29:48,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:48,669 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:29:48,669 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:29:48,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:29:48,670 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:48,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 79 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:29:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:29:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:29:48,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:48,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:48,672 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:48,672 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:48,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:48,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:48,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:48,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:29:48,672 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:29:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:48,673 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:48,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:48,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:48,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:48,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:29:48,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 17:29:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:48,674 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:29:48,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:48,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:48,679 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:48,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:48,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:48,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:29:48,985 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:29:48,985 INFO L858 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-02-20 17:29:48,985 INFO L858 garLoopResultBuilder]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2022-02-20 17:29:48,985 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:29:48,986 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:48,986 INFO L854 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:48,986 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:29:48,986 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:29:48,986 INFO L861 garLoopResultBuilder]: At program point L45(lines 22 46) the Hoare annotation is: true [2022-02-20 17:29:48,986 INFO L854 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:48,986 INFO L858 garLoopResultBuilder]: For program point L35-1(lines 34 43) no Hoare annotation was computed. [2022-02-20 17:29:48,986 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-02-20 17:29:48,987 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-02-20 17:29:48,987 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-02-20 17:29:48,987 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:48,987 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:48,987 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 17:29:48,990 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 17:29:48,991 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:48,994 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:29:48,994 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:48,994 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:29:48,994 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:48,994 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:48,998 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:48,998 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:48,998 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:48,998 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 17:29:48,998 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:29:48,998 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:48,998 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:48,998 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:48,999 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:48,999 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:29:48,999 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:48,999 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:48,999 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:48,999 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:48,999 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:48,999 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:29:49,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:29:49 BoogieIcfgContainer [2022-02-20 17:29:49,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:29:49,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:29:49,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:29:49,009 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:29:49,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:27" (3/4) ... [2022-02-20 17:29:49,011 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:29:49,016 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:29:49,020 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 17:29:49,020 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:29:49,020 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:29:49,021 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:29:49,053 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:29:49,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:29:49,055 INFO L158 Benchmark]: Toolchain (without parser) took 21602.50ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 54.9MB in the beginning and 40.5MB in the end (delta: 14.4MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2022-02-20 17:29:49,059 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 88.1MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:49,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.75ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 54.7MB in the beginning and 86.2MB in the end (delta: -31.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:49,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.19ms. Allocated memory is still 111.1MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:49,060 INFO L158 Benchmark]: Boogie Preprocessor took 16.41ms. Allocated memory is still 111.1MB. Free memory was 84.5MB in the beginning and 83.8MB in the end (delta: 738.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:49,061 INFO L158 Benchmark]: RCFGBuilder took 238.11ms. Allocated memory is still 111.1MB. Free memory was 83.4MB in the beginning and 72.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:49,061 INFO L158 Benchmark]: TraceAbstraction took 21034.68ms. Allocated memory is still 111.1MB. Free memory was 72.6MB in the beginning and 43.4MB in the end (delta: 29.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:49,062 INFO L158 Benchmark]: Witness Printer took 45.22ms. Allocated memory is still 111.1MB. Free memory was 42.6MB in the beginning and 40.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:49,065 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.24ms. Allocated memory is still 88.1MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.75ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 54.7MB in the beginning and 86.2MB in the end (delta: -31.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.19ms. Allocated memory is still 111.1MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.41ms. Allocated memory is still 111.1MB. Free memory was 84.5MB in the beginning and 83.8MB in the end (delta: 738.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 238.11ms. Allocated memory is still 111.1MB. Free memory was 83.4MB in the beginning and 72.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21034.68ms. Allocated memory is still 111.1MB. Free memory was 72.6MB in the beginning and 43.4MB in the end (delta: 29.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 45.22ms. Allocated memory is still 111.1MB. Free memory was 42.6MB in the beginning and 40.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 56 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 13 PreInvPairs, 23 NumberOfFragments, 35 HoareAnnotationTreeSize, 13 FomulaSimplifications, 57 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 67 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 263 SizeOfPredicates, 5 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: x * z + a == x + az * y RESULT: Ultimate proved your program to be correct! [2022-02-20 17:29:49,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE