./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label58.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/eca-rers2012/Problem19_label58.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 a53da247d111b038b398eff5160740a2a02616f3c1ac05da6f779ac954a53edf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:06:33,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:06:33,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:06:33,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:06:33,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:06:33,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:06:33,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:06:33,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:06:33,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:06:33,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:06:33,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:06:33,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:06:33,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:06:33,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:06:33,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:06:33,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:06:33,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:06:33,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:06:33,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:06:33,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:06:33,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:06:33,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:06:33,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:06:33,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:06:33,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:06:33,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:06:33,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:06:33,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:06:33,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:06:33,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:06:33,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:06:33,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:06:33,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:06:33,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:06:33,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:06:33,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:06:33,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:06:33,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:06:33,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:06:33,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:06:33,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:06:33,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:06:33,847 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:06:33,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:06:33,848 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:06:33,848 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:06:33,848 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:06:33,848 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:06:33,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:06:33,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:06:33,849 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:06:33,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:06:33,850 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:06:33,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:06:33,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:06:33,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:06:33,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:06:33,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:06:33,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:06:33,851 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:06:33,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:06:33,851 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:06:33,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:06:33,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:06:33,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:06:33,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:06:33,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:06:33,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:06:33,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:06:33,853 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:06:33,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:06:33,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:06:33,854 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:06:33,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:06:33,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:06:33,854 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 -> a53da247d111b038b398eff5160740a2a02616f3c1ac05da6f779ac954a53edf [2022-02-20 16:06:34,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:06:34,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:06:34,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:06:34,045 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:06:34,046 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:06:34,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label58.c [2022-02-20 16:06:34,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/623210a79/4e488955185e47ac9f5d70a1a568cd65/FLAG09cb81bba [2022-02-20 16:06:34,768 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:06:34,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label58.c [2022-02-20 16:06:34,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/623210a79/4e488955185e47ac9f5d70a1a568cd65/FLAG09cb81bba [2022-02-20 16:06:34,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/623210a79/4e488955185e47ac9f5d70a1a568cd65 [2022-02-20 16:06:34,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:06:34,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:06:34,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:06:34,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:06:34,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:06:34,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:06:34" (1/1) ... [2022-02-20 16:06:34,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615fe8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:34, skipping insertion in model container [2022-02-20 16:06:34,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:06:34" (1/1) ... [2022-02-20 16:06:34,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:06:35,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:06:35,230 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/eca-rers2012/Problem19_label58.c[2142,2155] [2022-02-20 16:06:36,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:06:36,266 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:06:36,287 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/eca-rers2012/Problem19_label58.c[2142,2155] [2022-02-20 16:06:36,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:06:36,870 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:06:36,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36 WrapperNode [2022-02-20 16:06:36,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:06:36,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:06:36,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:06:36,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:06:36,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:36,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:37,682 INFO L137 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9425 [2022-02-20 16:06:37,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:06:37,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:06:37,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:06:37,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:06:37,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:37,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:37,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:37,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:38,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:38,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:38,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:38,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:06:38,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:06:38,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:06:38,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:06:38,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (1/1) ... [2022-02-20 16:06:38,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:06:38,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:06:38,552 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 16:06:38,572 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 16:06:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:06:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:06:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:06:38,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:06:38,631 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:06:38,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:06:52,094 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:06:52,113 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:06:52,113 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:06:52,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:06:52 BoogieIcfgContainer [2022-02-20 16:06:52,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:06:52,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:06:52,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:06:52,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:06:52,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:06:34" (1/3) ... [2022-02-20 16:06:52,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1625281b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:06:52, skipping insertion in model container [2022-02-20 16:06:52,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:06:36" (2/3) ... [2022-02-20 16:06:52,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1625281b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:06:52, skipping insertion in model container [2022-02-20 16:06:52,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:06:52" (3/3) ... [2022-02-20 16:06:52,122 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem19_label58.c [2022-02-20 16:06:52,125 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:06:52,125 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:06:52,170 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:06:52,176 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 16:06:52,176 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:06:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8699885452462772) internal successors, (3265), 1747 states have internal predecessors, (3265), 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 16:06:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:06:52,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:06:52,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:06:52,218 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:06:52,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:06:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash -461255479, now seen corresponding path program 1 times [2022-02-20 16:06:52,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:06:52,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742989934] [2022-02-20 16:06:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:06:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:06:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:06:52,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {1751#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(20, 2);call #Ultimate.allocInit(12, 3);~inputA~0 := 1;~inputF~0 := 6;~inputC~0 := 3;~inputE~0 := 5;~inputD~0 := 4;~inputB~0 := 2;~a27~0 := -83;~a9~0 := 3;~a14~0 := -162;~a21~0 := -189;~a8~0 := 7; {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~input~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret11#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0); {1753#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:06:52,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {1753#(<= (+ ~a21~0 189) 0)} assume (((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && 5 < ~a21~0; {1752#false} is VALID [2022-02-20 16:06:52,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {1752#false} assume !false; {1752#false} is VALID [2022-02-20 16:06:52,403 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 16:06:52,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:06:52,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742989934] [2022-02-20 16:06:52,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742989934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:06:52,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:06:52,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:06:52,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924660432] [2022-02-20 16:06:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:06:52,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 16:06:52,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:06:52,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 16:06:52,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:06:52,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:06:52,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:06:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:06:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:06:52,452 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8699885452462772) internal successors, (3265), 1747 states have internal predecessors, (3265), 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 has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 16:07:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:04,507 INFO L93 Difference]: Finished difference Result 4957 states and 9398 transitions. [2022-02-20 16:07:04,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:07:04,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2022-02-20 16:07:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:07:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 16:07:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9398 transitions. [2022-02-20 16:07:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 16:07:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9398 transitions. [2022-02-20 16:07:04,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9398 transitions. [2022-02-20 16:07:11,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9398 edges. 9398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:11,904 INFO L225 Difference]: With dead ends: 4957 [2022-02-20 16:07:11,904 INFO L226 Difference]: Without dead ends: 3129 [2022-02-20 16:07:11,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:07:11,911 INFO L933 BasicCegarLoop]: 1373 mSDtfsCounter, 1613 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:07:11,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 1595 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1517 Valid, 4344 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-02-20 16:07:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2022-02-20 16:07:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3108. [2022-02-20 16:07:12,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:07:12,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3129 states. Second operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 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 16:07:12,021 INFO L74 IsIncluded]: Start isIncluded. First operand 3129 states. Second operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 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 16:07:12,026 INFO L87 Difference]: Start difference. First operand 3129 states. Second operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 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 16:07:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:12,321 INFO L93 Difference]: Finished difference Result 3129 states and 5017 transitions. [2022-02-20 16:07:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 5017 transitions. [2022-02-20 16:07:12,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:12,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:12,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 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 3129 states. [2022-02-20 16:07:12,344 INFO L87 Difference]: Start difference. First operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 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 3129 states. [2022-02-20 16:07:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:07:12,629 INFO L93 Difference]: Finished difference Result 3129 states and 5017 transitions. [2022-02-20 16:07:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 5017 transitions. [2022-02-20 16:07:12,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:07:12,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:07:12,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:07:12,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:07:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 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 16:07:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4975 transitions. [2022-02-20 16:07:12,965 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4975 transitions. Word has length 13 [2022-02-20 16:07:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:07:12,966 INFO L470 AbstractCegarLoop]: Abstraction has 3108 states and 4975 transitions. [2022-02-20 16:07:12,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 16:07:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4975 transitions. [2022-02-20 16:07:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 16:07:12,967 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:07:12,968 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:07:12,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:07:12,969 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:07:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:07:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash 648936932, now seen corresponding path program 1 times [2022-02-20 16:07:12,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:07:12,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538104270] [2022-02-20 16:07:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:07:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:07:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:07:13,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {16117#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(20, 2);call #Ultimate.allocInit(12, 3);~inputA~0 := 1;~inputF~0 := 6;~inputC~0 := 3;~inputE~0 := 5;~inputD~0 := 4;~inputB~0 := 2;~a27~0 := -83;~a9~0 := 3;~a14~0 := -162;~a21~0 := -189;~a8~0 := 7; {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~input~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret11#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && 5 < ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 3 == ~a9~0) && 5 < ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 4 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 4 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 5 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 2 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 6 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 2 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 7 == ~a8~0) && 2 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 4 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 6 == ~a9~0) && 5 < ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 2 == ~a9~0) && ~a21~0 <= -178); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 4 == ~a9~0) && 5 < ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 2 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 3 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 6 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 3 == ~a9~0) && 5 < ~a21~0); {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} is VALID [2022-02-20 16:07:13,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {16119#(and (<= (+ ~a21~0 189) 0) (= 3 ~a9~0) (<= (+ ~a27~0 83) 0) (<= (+ ~a14~0 162) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && ~a21~0 <= -178); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 2 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 3 == ~a9~0) && ~a21~0 <= -178); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 2 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 3 == ~a9~0) && ~a21~0 <= -178); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 3 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && 5 < ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 6 == ~a9~0) && ~a21~0 <= -178); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 4 == ~a9~0) && 5 < ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 4 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 6 == ~a9~0) && ~a21~0 <= -178); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && 5 < ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 6 == ~a9~0) && 5 < ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,210 INFO L290 TraceCheckUtils]: 62: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {16120#(not (= (+ ~a8~0 (- 4)) 0))} is VALID [2022-02-20 16:07:13,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {16120#(not (= (+ ~a8~0 (- 4)) 0))} assume ((~a14~0 <= -148 && (2 == calculate_output_~input#1 && ~a21~0 <= -178) && 4 == ~a8~0) && 100 < ~a27~0 && 182 >= ~a27~0) && 3 == ~a9~0; {16118#false} is VALID [2022-02-20 16:07:13,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {16118#false} assume !(6 == ~a9~0);~a27~0 := 89 + (~a27~0 - 173);~a21~0 := 40 + (~a21~0 - -600084);~a8~0 := 5; {16118#false} is VALID [2022-02-20 16:07:13,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {16118#false} calculate_output_#res#1 := 25; {16118#false} is VALID [2022-02-20 16:07:13,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {16118#false} main_#t~ret17#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647;main_~output~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; {16118#false} is VALID [2022-02-20 16:07:13,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {16118#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~input~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {16118#false} is VALID [2022-02-20 16:07:13,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {16118#false} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret11#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {16118#false} is VALID [2022-02-20 16:07:13,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {16118#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {16118#false} is VALID [2022-02-20 16:07:13,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {16118#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16118#false} is VALID [2022-02-20 16:07:13,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {16118#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16118#false} is VALID [2022-02-20 16:07:13,213 INFO L290 TraceCheckUtils]: 74: Hoare triple {16118#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {16118#false} is VALID [2022-02-20 16:07:13,213 INFO L290 TraceCheckUtils]: 75: Hoare triple {16118#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {16118#false} is VALID [2022-02-20 16:07:13,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {16118#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16118#false} is VALID [2022-02-20 16:07:13,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {16118#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0); {16118#false} is VALID [2022-02-20 16:07:13,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {16118#false} assume (((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && 5 < ~a21~0; {16118#false} is VALID [2022-02-20 16:07:13,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {16118#false} assume !false; {16118#false} is VALID [2022-02-20 16:07:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:07:13,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:07:13,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538104270] [2022-02-20 16:07:13,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538104270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:07:13,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:07:13,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:07:13,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224890765] [2022-02-20 16:07:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:07:13,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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) Word has length 80 [2022-02-20 16:07:13,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:07:13,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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 16:07:13,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:07:13,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:07:13,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:07:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:07:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:07:13,272 INFO L87 Difference]: Start difference. First operand 3108 states and 4975 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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)