./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire2_unwindbound2.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/freire2_unwindbound2.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 25e51a8adaedf780ebc17d825bcf8567c6fe26dcb93621320dae5eec1509e5a5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:27:06,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:27:06,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:27:06,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:27:06,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:27:06,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:27:06,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:27:06,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:27:06,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:27:06,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:27:06,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:27:06,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:27:06,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:27:06,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:27:06,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:27:06,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:27:06,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:27:06,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:27:06,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:27:06,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:27:06,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:27:06,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:27:06,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:27:06,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:27:06,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:27:06,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:27:06,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:27:06,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:27:06,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:27:06,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:27:06,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:27:06,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:27:06,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:27:06,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:27:06,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:27:06,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:27:06,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:27:06,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:27:06,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:27:06,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:27:06,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:27:06,170 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:27:06,186 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:27:06,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:27:06,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:27:06,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:27:06,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:27:06,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:27:06,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:27:06,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:27:06,191 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:27:06,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:27:06,192 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:27:06,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:27:06,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:27:06,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:27:06,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:27:06,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:27:06,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:27:06,193 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:27:06,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:27:06,193 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:27:06,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:27:06,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:27:06,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:27:06,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:27:06,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:27:06,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:27:06,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:27:06,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:27:06,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:27:06,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:27:06,196 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:27:06,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:27:06,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:27:06,196 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 -> 25e51a8adaedf780ebc17d825bcf8567c6fe26dcb93621320dae5eec1509e5a5 [2022-02-20 17:27:06,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:27:06,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:27:06,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:27:06,373 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:27:06,385 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:27:06,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire2_unwindbound2.c [2022-02-20 17:27:06,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d889eee0e/019710aef827457a9c49cfe1890df368/FLAGe27eb605f [2022-02-20 17:27:06,805 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:27:06,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_unwindbound2.c [2022-02-20 17:27:06,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d889eee0e/019710aef827457a9c49cfe1890df368/FLAGe27eb605f [2022-02-20 17:27:07,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d889eee0e/019710aef827457a9c49cfe1890df368 [2022-02-20 17:27:07,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:27:07,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:27:07,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:27:07,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:27:07,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:27:07,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54eaac44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07, skipping insertion in model container [2022-02-20 17:27:07,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:27:07,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:27:07,363 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/freire2_unwindbound2.c[709,722] [2022-02-20 17:27:07,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:27:07,406 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:27:07,417 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/freire2_unwindbound2.c[709,722] [2022-02-20 17:27:07,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:27:07,446 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:27:07,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07 WrapperNode [2022-02-20 17:27:07,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:27:07,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:27:07,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:27:07,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:27:07,454 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:27:07" (1/1) ... [2022-02-20 17:27:07,469 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:27:07" (1/1) ... [2022-02-20 17:27:07,495 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2022-02-20 17:27:07,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:27:07,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:27:07,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:27:07,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:27:07,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:27:07,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:27:07,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:27:07,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:27:07,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (1/1) ... [2022-02-20 17:27:07,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:27:07,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:27:07,579 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:27:07,592 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:27:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:27:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:27:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:27:07,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:27:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:27:07,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:27:07,675 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:27:07,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:27:07,764 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:27:07,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:27:07,769 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:27:07,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:27:07 BoogieIcfgContainer [2022-02-20 17:27:07,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:27:07,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:27:07,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:27:07,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:27:07,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:27:07" (1/3) ... [2022-02-20 17:27:07,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5968f86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:27:07, skipping insertion in model container [2022-02-20 17:27:07,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:07" (2/3) ... [2022-02-20 17:27:07,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5968f86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:27:07, skipping insertion in model container [2022-02-20 17:27:07,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:27:07" (3/3) ... [2022-02-20 17:27:07,777 INFO L111 eAbstractionObserver]: Analyzing ICFG freire2_unwindbound2.c [2022-02-20 17:27:07,780 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:27:07,781 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:27:07,813 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:27:07,822 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:27:07,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:27:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:27:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:27:07,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:27:07,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:27:07,848 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:27:07,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:27:07,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1821846948, now seen corresponding path program 1 times [2022-02-20 17:27:07,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:27:07,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200864598] [2022-02-20 17:27:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:27:07,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:27:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:27:08,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24#true} is VALID [2022-02-20 17:27:08,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~r~0#1, main_~a~0#1, main_~x~0#1, main_~s~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~s~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~a~0#1;main_~s~0#1 := 3.25;main_~r~0#1 := 1; {24#true} is VALID [2022-02-20 17:27:08,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-20 17:27:08,037 INFO L272 TraceCheckUtils]: 3: Hoare triple {25#false} call __VERIFIER_assert((if 1 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(4), main_~s~0#1)) - 12 * main_~r~0#1 * main_~r~0#1 then 1 else 0)); {25#false} is VALID [2022-02-20 17:27:08,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-02-20 17:27:08,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-02-20 17:27:08,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 17:27:08,038 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:27:08,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:27:08,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200864598] [2022-02-20 17:27:08,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200864598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:27:08,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:27:08,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:27:08,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003039521] [2022-02-20 17:27:08,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:27:08,046 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:27:08,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:27:08,052 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:27:08,074 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:27:08,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:27:08,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:27:08,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:27:08,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:27:08,089 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:27:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:08,125 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2022-02-20 17:27:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:27:08,125 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:27:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:27:08,126 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:27:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:27:08,133 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:27:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:27:08,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:27:08,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:27:08,233 INFO L225 Difference]: With dead ends: 40 [2022-02-20 17:27:08,234 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:27:08,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:27:08,238 INFO L933 BasicCegarLoop]: 27 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, 27 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:27:08,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:27:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:27:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 17:27:08,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:27:08,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:08,259 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:08,259 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:08,262 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-20 17:27:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 17:27:08,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:27:08,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:27:08,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 17 states. [2022-02-20 17:27:08,264 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 17 states. [2022-02-20 17:27:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:08,266 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-20 17:27:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 17:27:08,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:27:08,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:27:08,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:27:08,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:27:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-02-20 17:27:08,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 7 [2022-02-20 17:27:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:27:08,270 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-20 17:27:08,270 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:27:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 17:27:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:27:08,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:27:08,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:27:08,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:27:08,272 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:27:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:27:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash 178653015, now seen corresponding path program 1 times [2022-02-20 17:27:08,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:27:08,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025815683] [2022-02-20 17:27:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:27:08,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:27:08,286 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:27:08,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685713085] [2022-02-20 17:27:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:27:08,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:27:08,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:27:08,307 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:27:08,308 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:27:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:27:08,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:27:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:27:08,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:27:08,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#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; {150#(<= ~counter~0 0)} is VALID [2022-02-20 17:27:08,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(<= ~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~post5#1, main_~r~0#1, main_~a~0#1, main_~x~0#1, main_~s~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~s~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~a~0#1;main_~s~0#1 := 3.25;main_~r~0#1 := 1; {150#(<= ~counter~0 0)} is VALID [2022-02-20 17:27:08,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {157#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:27:08,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 2);havoc main_#t~post5#1; {146#false} is VALID [2022-02-20 17:27:08,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#false} call __VERIFIER_assert((if 1 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(4), main_~s~0#1)) - 12 * main_~r~0#1 * main_~r~0#1 then 1 else 0)); {146#false} is VALID [2022-02-20 17:27:08,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#false} ~cond := #in~cond; {146#false} is VALID [2022-02-20 17:27:08,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#false} assume 0 == ~cond; {146#false} is VALID [2022-02-20 17:27:08,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#false} assume !false; {146#false} is VALID [2022-02-20 17:27:08,407 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:27:08,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:27:08,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:27:08,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025815683] [2022-02-20 17:27:08,408 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:27:08,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685713085] [2022-02-20 17:27:08,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685713085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:27:08,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:27:08,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:27:08,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777127365] [2022-02-20 17:27:08,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:27:08,410 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:27:08,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:27:08,411 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:27:08,417 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:27:08,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:27:08,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:27:08,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:27:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:27:08,418 INFO L87 Difference]: Start difference. First operand 17 states and 23 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:27:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:08,462 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 17:27:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:27:08,462 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:27:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:27:08,463 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:27:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 17:27:08,465 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:27:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 17:27:08,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-02-20 17:27:08,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:27:08,493 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:27:08,494 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:27:08,494 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:27:08,495 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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:27:08,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:27:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:27:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:27:08,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:27:08,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:08,499 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:08,500 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:08,501 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-20 17:27:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:27:08,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:27:08,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:27:08,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 19 states. [2022-02-20 17:27:08,502 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 19 states. [2022-02-20 17:27:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:08,504 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-20 17:27:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:27:08,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:27:08,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:27:08,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:27:08,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:27:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-20 17:27:08,506 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 8 [2022-02-20 17:27:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:27:08,507 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-20 17:27:08,507 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:27:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:27:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:27:08,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:27:08,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:27:08,525 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:27:08,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:27:08,727 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:27:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:27:08,727 INFO L85 PathProgramCache]: Analyzing trace with hash 180321311, now seen corresponding path program 1 times [2022-02-20 17:27:08,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:27:08,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867024481] [2022-02-20 17:27:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:27:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:27:08,745 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:27:08,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189511722] [2022-02-20 17:27:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:27:08,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:27:08,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:27:08,761 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:27:08,762 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:27:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:27:08,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:27:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:27:08,800 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:27:08,801 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:27:08,801 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:27:08,838 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:27:09,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:27:09,042 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:27:09,044 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:27:09,050 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 1 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(4), ~s~0)) - 12 * ~r~0 * ~r~0 then 1 else 0)); [2022-02-20 17:27:09,050 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:27:09,053 INFO L158 Benchmark]: Toolchain (without parser) took 1818.26ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 44.9MB in the end (delta: 10.8MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-02-20 17:27:09,054 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:27:09,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.39ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.4MB in the beginning and 86.1MB in the end (delta: -30.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-20 17:27:09,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.81ms. Allocated memory is still 111.1MB. Free memory was 86.1MB in the beginning and 84.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:27:09,054 INFO L158 Benchmark]: Boogie Preprocessor took 35.12ms. Allocated memory is still 111.1MB. Free memory was 84.4MB in the beginning and 83.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:27:09,055 INFO L158 Benchmark]: RCFGBuilder took 238.47ms. Allocated memory is still 111.1MB. Free memory was 83.1MB in the beginning and 73.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:27:09,055 INFO L158 Benchmark]: TraceAbstraction took 1280.20ms. Allocated memory is still 111.1MB. Free memory was 72.9MB in the beginning and 44.9MB in the end (delta: 28.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-02-20 17:27:09,056 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.39ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.4MB in the beginning and 86.1MB in the end (delta: -30.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.81ms. Allocated memory is still 111.1MB. Free memory was 86.1MB in the beginning and 84.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.12ms. Allocated memory is still 111.1MB. Free memory was 84.4MB in the beginning and 83.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.47ms. Allocated memory is still 111.1MB. Free memory was 83.1MB in the beginning and 73.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1280.20ms. Allocated memory is still 111.1MB. Free memory was 72.9MB in the beginning and 44.9MB in the end (delta: 28.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:27:09,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire2_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25e51a8adaedf780ebc17d825bcf8567c6fe26dcb93621320dae5eec1509e5a5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:27:10,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:27:10,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:27:10,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:27:10,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:27:10,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:27:10,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:27:10,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:27:10,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:27:10,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:27:10,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:27:10,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:27:10,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:27:10,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:27:10,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:27:10,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:27:10,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:27:10,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:27:10,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:27:10,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:27:10,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:27:10,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:27:10,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:27:10,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:27:10,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:27:10,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:27:10,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:27:10,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:27:10,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:27:10,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:27:10,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:27:10,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:27:10,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:27:10,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:27:10,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:27:10,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:27:10,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:27:10,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:27:10,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:27:10,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:27:10,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:27:10,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:27:10,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:27:10,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:27:10,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:27:10,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:27:10,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:27:10,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:27:10,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:27:10,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:27:10,929 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:27:10,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:27:10,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:27:10,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:27:10,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:27:10,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:27:10,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:27:10,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:27:10,931 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:27:10,931 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:27:10,931 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:27:10,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:27:10,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:27:10,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:27:10,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:27:10,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:27:10,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:27:10,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:27:10,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:27:10,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:27:10,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:27:10,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:27:10,933 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:27:10,933 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:27:10,933 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:27:10,933 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:27:10,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:27:10,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:27:10,934 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25e51a8adaedf780ebc17d825bcf8567c6fe26dcb93621320dae5eec1509e5a5 [2022-02-20 17:27:11,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:27:11,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:27:11,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:27:11,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:27:11,158 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:27:11,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire2_unwindbound2.c [2022-02-20 17:27:11,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c410a9e3/be5b88e60851437289dbedae1ff67be5/FLAG0eb8151ae [2022-02-20 17:27:11,556 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:27:11,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_unwindbound2.c [2022-02-20 17:27:11,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c410a9e3/be5b88e60851437289dbedae1ff67be5/FLAG0eb8151ae [2022-02-20 17:27:11,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c410a9e3/be5b88e60851437289dbedae1ff67be5 [2022-02-20 17:27:11,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:27:11,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:27:11,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:27:11,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:27:11,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:27:11,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:27:11" (1/1) ... [2022-02-20 17:27:11,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365336f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:11, skipping insertion in model container [2022-02-20 17:27:11,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:27:11" (1/1) ... [2022-02-20 17:27:11,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:27:12,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:27:12,090 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/freire2_unwindbound2.c[709,722] [2022-02-20 17:27:12,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:27:12,139 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:27:12,146 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/freire2_unwindbound2.c[709,722] [2022-02-20 17:27:12,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:27:12,163 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:27:12,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12 WrapperNode [2022-02-20 17:27:12,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:27:12,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:27:12,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:27:12,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:27:12,169 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:27:12" (1/1) ... [2022-02-20 17:27:12,175 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:27:12" (1/1) ... [2022-02-20 17:27:12,188 INFO L137 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-02-20 17:27:12,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:27:12,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:27:12,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:27:12,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:27:12,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (1/1) ... [2022-02-20 17:27:12,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (1/1) ... [2022-02-20 17:27:12,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (1/1) ... [2022-02-20 17:27:12,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (1/1) ... [2022-02-20 17:27:12,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (1/1) ... [2022-02-20 17:27:12,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (1/1) ... [2022-02-20 17:27:12,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (1/1) ... [2022-02-20 17:27:12,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:27:12,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:27:12,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:27:12,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:27:12,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (1/1) ... [2022-02-20 17:27:12,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:27:12,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:27:12,236 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:27:12,244 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:27:12,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:27:12,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:27:12,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:27:12,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:27:12,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:27:12,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:27:12,326 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:27:12,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:27:14,487 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:27:14,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:27:14,492 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:27:14,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:27:14 BoogieIcfgContainer [2022-02-20 17:27:14,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:27:14,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:27:14,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:27:14,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:27:14,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:27:11" (1/3) ... [2022-02-20 17:27:14,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2442a77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:27:14, skipping insertion in model container [2022-02-20 17:27:14,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:27:12" (2/3) ... [2022-02-20 17:27:14,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2442a77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:27:14, skipping insertion in model container [2022-02-20 17:27:14,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:27:14" (3/3) ... [2022-02-20 17:27:14,498 INFO L111 eAbstractionObserver]: Analyzing ICFG freire2_unwindbound2.c [2022-02-20 17:27:14,512 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:27:14,512 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:27:14,551 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:27:14,556 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:27:14,556 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:27:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:27:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:27:14,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:27:14,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:27:14,595 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:27:14,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:27:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1821846948, now seen corresponding path program 1 times [2022-02-20 17:27:14,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:27:14,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075101517] [2022-02-20 17:27:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:27:14,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:27:14,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:27:14,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:27:14,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:27:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:27:14,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:27:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:27:14,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:27:14,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {24#true} is VALID [2022-02-20 17:27:14,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~r~0#1, main_~a~0#1, main_~x~0#1, main_~s~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~s~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~a~0#1;main_~s~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 3.25);main_~r~0#1 := 1bv32; {24#true} is VALID [2022-02-20 17:27:14,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-20 17:27:14,819 INFO L272 TraceCheckUtils]: 3: Hoare triple {25#false} call __VERIFIER_assert((if 1bv32 == ~bvsub32(~convertDOUBLEToINT(~roundTowardZero, ~fp.mul~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 4bv32), main_~s~0#1)), ~bvmul32(~bvmul32(12bv32, main_~r~0#1), main_~r~0#1)) then 1bv32 else 0bv32)); {25#false} is VALID [2022-02-20 17:27:14,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-02-20 17:27:14,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2022-02-20 17:27:14,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 17:27:14,820 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:27:14,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:27:14,821 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:27:14,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075101517] [2022-02-20 17:27:14,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075101517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:27:14,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:27:14,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:27:14,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562315988] [2022-02-20 17:27:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:27:14,827 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:27:14,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:27:14,830 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:27:14,884 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:27:14,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:27:14,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:27:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:27:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:27:14,914 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:27:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:34,694 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2022-02-20 17:27:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:27:34,695 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:27:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:27:34,696 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:27:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:27:34,714 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:27:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:27:34,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:27:40,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:27:40,966 INFO L225 Difference]: With dead ends: 40 [2022-02-20 17:27:40,966 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:27:40,970 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:27:40,974 INFO L933 BasicCegarLoop]: 27 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, 27 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:27:40,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:27:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:27:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 17:27:40,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:27:40,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:40,995 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:40,995 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:40,998 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-20 17:27:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 17:27:40,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:27:40,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:27:40,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 17 states. [2022-02-20 17:27:40,999 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 17 states. [2022-02-20 17:27:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:27:41,002 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-20 17:27:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 17:27:41,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:27:41,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:27:41,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:27:41,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:27:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:27:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-02-20 17:27:41,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 7 [2022-02-20 17:27:41,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:27:41,006 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-20 17:27:41,006 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:27:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-20 17:27:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:27:41,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:27:41,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:27:41,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 17:27:41,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:27:41,218 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:27:41,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:27:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash 178653015, now seen corresponding path program 1 times [2022-02-20 17:27:41,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:27:41,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847851783] [2022-02-20 17:27:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:27:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:27:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:27:41,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:27:41,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:27:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:27:41,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:27:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:27:41,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:27:41,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {168#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:27:41,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~r~0#1, main_~a~0#1, main_~x~0#1, main_~s~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~s~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~a~0#1;main_~s~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 3.25);main_~r~0#1 := 1bv32; {168#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:27:41,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {175#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} is VALID [2022-02-20 17:27:41,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {175#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} assume !~bvslt32(main_#t~post5#1, 2bv32);havoc main_#t~post5#1; {164#false} is VALID [2022-02-20 17:27:41,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#false} call __VERIFIER_assert((if 1bv32 == ~bvsub32(~convertDOUBLEToINT(~roundTowardZero, ~fp.mul~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 4bv32), main_~s~0#1)), ~bvmul32(~bvmul32(12bv32, main_~r~0#1), main_~r~0#1)) then 1bv32 else 0bv32)); {164#false} is VALID [2022-02-20 17:27:41,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID [2022-02-20 17:27:41,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#false} assume 0bv32 == ~cond; {164#false} is VALID [2022-02-20 17:27:41,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-02-20 17:27:41,536 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:27:41,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:27:41,536 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:27:41,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847851783] [2022-02-20 17:27:41,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847851783] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:27:41,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:27:41,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:27:41,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554142551] [2022-02-20 17:27:41,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:27:41,538 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:27:41,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:27:41,538 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:27:41,600 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:27:41,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:27:41,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:27:41,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:27:41,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:27:41,601 INFO L87 Difference]: Start difference. First operand 17 states and 23 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)