./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_square_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_square_65_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cfc00127be80095153924dbb040bda5af086a3d16fffc3b3d194cb97d865ae1a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:18:49,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:18:49,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 12:18:49,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:18:49,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:18:49,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:18:49,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:18:49,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:18:49,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:18:49,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:18:49,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:18:49,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:18:49,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:18:49,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:18:49,638 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:18:49,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:18:49,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:18:49,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 12:18:49,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:18:49,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:18:49,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:18:49,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:18:49,646 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:18:49,646 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:18:49,646 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:18:49,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:18:49,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:18:49,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:18:49,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:18:49,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:18:49,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:18:49,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:18:49,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:18:49,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:18:49,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:18:49,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 12:18:49,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 12:18:49,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:18:49,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:18:49,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:18:49,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:18:49,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfc00127be80095153924dbb040bda5af086a3d16fffc3b3d194cb97d865ae1a [2024-11-19 12:18:49,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:18:49,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:18:49,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:18:49,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:18:49,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:18:49,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_square_65_good.i [2024-11-19 12:18:51,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:18:51,761 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:18:51,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_square_65_good.i [2024-11-19 12:18:51,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b81e58190/08c2ac6832d44443b6cf1b50fc531f38/FLAGe352d06df [2024-11-19 12:18:51,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b81e58190/08c2ac6832d44443b6cf1b50fc531f38 [2024-11-19 12:18:51,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:18:51,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:18:51,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:18:51,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:18:51,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:18:51,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:18:51" (1/1) ... [2024-11-19 12:18:51,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e2b7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:51, skipping insertion in model container [2024-11-19 12:18:51,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:18:51" (1/1) ... [2024-11-19 12:18:52,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:18:53,160 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:3125) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1026) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:283) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:790) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:790) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1751) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:233) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1165) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1148) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1628) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3506) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2498) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:640) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-19 12:18:53,169 INFO L158 Benchmark]: Toolchain (without parser) took 1188.17ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 120.9MB in the end (delta: -26.5MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2024-11-19 12:18:53,170 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:18:53,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1185.80ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 121.0MB in the end (delta: -26.7MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2024-11-19 12:18:53,172 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1185.80ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 121.0MB in the end (delta: -26.7MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_square_65_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cfc00127be80095153924dbb040bda5af086a3d16fffc3b3d194cb97d865ae1a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:18:55,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:18:55,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 12:18:55,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:18:55,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:18:55,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 12:18:55,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:18:55,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:18:55,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:18:55,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:18:55,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:18:55,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:18:55,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:18:55,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:18:55,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:18:55,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:18:55,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:18:55,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:18:55,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:18:55,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:18:55,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:18:55,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:18:55,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 12:18:55,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 12:18:55,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:18:55,328 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:18:55,328 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 12:18:55,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:18:55,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:18:55,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:18:55,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:18:55,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:18:55,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:18:55,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:18:55,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:18:55,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:18:55,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:18:55,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:18:55,337 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 12:18:55,337 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 12:18:55,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:18:55,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:18:55,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:18:55,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:18:55,343 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfc00127be80095153924dbb040bda5af086a3d16fffc3b3d194cb97d865ae1a [2024-11-19 12:18:55,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:18:55,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:18:55,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:18:55,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:18:55,690 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:18:55,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_square_65_good.i [2024-11-19 12:18:57,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:18:57,571 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:18:57,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_square_65_good.i [2024-11-19 12:18:57,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4122238/b85c5243b60e4e18a030ef489c03a8f7/FLAG600f5e777 [2024-11-19 12:18:57,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4122238/b85c5243b60e4e18a030ef489c03a8f7 [2024-11-19 12:18:57,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:18:57,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:18:57,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:18:57,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:18:57,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:18:57,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:18:57" (1/1) ... [2024-11-19 12:18:57,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fab989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:57, skipping insertion in model container [2024-11-19 12:18:57,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:18:57" (1/1) ... [2024-11-19 12:18:57,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:18:58,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:18:58,904 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:18:59,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:18:59,356 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:18:59,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59 WrapperNode [2024-11-19 12:18:59,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:18:59,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:18:59,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:18:59,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:18:59,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,441 INFO L138 Inliner]: procedures = 945, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 70 [2024-11-19 12:18:59,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:18:59,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:18:59,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:18:59,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:18:59,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,473 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 12:18:59,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:18:59,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:18:59,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:18:59,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:18:59,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (1/1) ... [2024-11-19 12:18:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:18:59,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:18:59,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 12:18:59,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 12:18:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-19 12:18:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-19 12:18:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:18:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:18:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:18:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:18:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:18:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_INT~TO~VOID [2024-11-19 12:18:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_INT~TO~VOID [2024-11-19 12:18:59,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:18:59,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:19:02,555 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-19 12:19:02,555 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:19:02,574 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:19:02,574 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:19:02,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:19:02 BoogieIcfgContainer [2024-11-19 12:19:02,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:19:02,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:19:02,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:19:02,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:19:02,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:18:57" (1/3) ... [2024-11-19 12:19:02,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed07526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:19:02, skipping insertion in model container [2024-11-19 12:19:02,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:18:59" (2/3) ... [2024-11-19 12:19:02,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed07526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:19:02, skipping insertion in model container [2024-11-19 12:19:02,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:19:02" (3/3) ... [2024-11-19 12:19:02,586 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_square_65_good.i [2024-11-19 12:19:02,602 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:19:02,603 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-19 12:19:02,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:19:02,679 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e4dfbdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:19:02,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 12:19:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 12:19:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 12:19:02,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:19:02,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:19:02,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 12:19:02,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:19:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1145192134, now seen corresponding path program 1 times [2024-11-19 12:19:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:19:02,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972335619] [2024-11-19 12:19:02,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:19:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:19:02,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:19:02,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 12:19:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:19:02,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 12:19:02,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:19:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:19:02,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:19:02,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:19:02,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972335619] [2024-11-19 12:19:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972335619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:19:02,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:19:02,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 12:19:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133573015] [2024-11-19 12:19:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:19:02,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 12:19:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:19:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 12:19:02,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 12:19:02,969 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:19:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:19:03,517 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2024-11-19 12:19:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 12:19:03,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 12:19:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:19:03,536 INFO L225 Difference]: With dead ends: 69 [2024-11-19 12:19:03,536 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 12:19:03,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 12:19:03,541 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 22 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 12:19:03,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 239 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 12:19:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 12:19:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-19 12:19:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 12:19:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-19 12:19:03,597 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 12 [2024-11-19 12:19:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:19:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-19 12:19:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:19:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-19 12:19:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 12:19:03,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:19:03,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:19:03,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 12:19:03,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:03,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 12:19:03,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:19:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1141193083, now seen corresponding path program 1 times [2024-11-19 12:19:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:19:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185444885] [2024-11-19 12:19:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:19:03,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:03,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:19:03,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:19:03,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 12:19:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:19:03,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 12:19:03,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:19:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:19:03,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:19:03,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:19:03,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185444885] [2024-11-19 12:19:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185444885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:19:03,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:19:03,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 12:19:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948047096] [2024-11-19 12:19:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:19:03,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:19:03,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:19:03,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:19:03,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:19:03,907 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:19:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:19:03,951 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-11-19 12:19:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:19:03,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 12:19:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:19:03,953 INFO L225 Difference]: With dead ends: 72 [2024-11-19 12:19:03,953 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 12:19:03,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:19:03,955 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:19:03,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:19:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 12:19:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 12:19:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:19:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-19 12:19:03,961 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 13 [2024-11-19 12:19:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:19:03,962 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-19 12:19:03,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:19:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-19 12:19:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 12:19:03,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:19:03,963 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:19:03,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 12:19:04,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:04,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 12:19:04,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:19:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash -37795508, now seen corresponding path program 1 times [2024-11-19 12:19:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:19:04,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901000316] [2024-11-19 12:19:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:19:04,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:04,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:19:04,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:19:04,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 12:19:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:19:04,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 12:19:04,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:19:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:19:04,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:19:04,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:19:04,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901000316] [2024-11-19 12:19:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901000316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:19:04,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:19:04,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 12:19:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590077914] [2024-11-19 12:19:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:19:04,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:19:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:19:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:19:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:19:04,358 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 12:19:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:19:04,382 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-19 12:19:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:19:04,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-19 12:19:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:19:04,384 INFO L225 Difference]: With dead ends: 37 [2024-11-19 12:19:04,384 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 12:19:04,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:19:04,385 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:19:04,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:19:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 12:19:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-19 12:19:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:19:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-19 12:19:04,395 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2024-11-19 12:19:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:19:04,396 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-19 12:19:04,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 12:19:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-19 12:19:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 12:19:04,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:19:04,398 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:19:04,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 12:19:04,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:04,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 12:19:04,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:19:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1171685451, now seen corresponding path program 1 times [2024-11-19 12:19:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:19:04,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379970092] [2024-11-19 12:19:04,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:19:04,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:04,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:19:04,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:19:04,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 12:19:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:19:04,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 12:19:04,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:19:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 12:19:04,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:19:04,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:19:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379970092] [2024-11-19 12:19:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379970092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:19:04,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:19:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:19:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67386200] [2024-11-19 12:19:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:19:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:19:04,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:19:04,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:19:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:19:04,746 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 12:19:08,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 12:19:12,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 12:19:16,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 12:19:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:19:16,877 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-19 12:19:16,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:19:16,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-19 12:19:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:19:16,882 INFO L225 Difference]: With dead ends: 34 [2024-11-19 12:19:16,882 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 12:19:16,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:19:16,883 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-19 12:19:16,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-11-19 12:19:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 12:19:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-19 12:19:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:19:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-19 12:19:16,889 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2024-11-19 12:19:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:19:16,890 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-19 12:19:16,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 12:19:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-19 12:19:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 12:19:16,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:19:16,891 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:19:16,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 12:19:17,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:17,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 12:19:17,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:19:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1962506509, now seen corresponding path program 1 times [2024-11-19 12:19:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:19:17,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201142351] [2024-11-19 12:19:17,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:19:17,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:17,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:19:17,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:19:17,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 12:19:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:19:17,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 12:19:17,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:19:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 12:19:17,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:19:17,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:19:17,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201142351] [2024-11-19 12:19:17,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201142351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:19:17,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:19:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:19:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926064313] [2024-11-19 12:19:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:19:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:19:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:19:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:19:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:19:17,221 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 12:19:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:19:17,262 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2024-11-19 12:19:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:19:17,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-19 12:19:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:19:17,263 INFO L225 Difference]: With dead ends: 37 [2024-11-19 12:19:17,263 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 12:19:17,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:19:17,264 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:19:17,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:19:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 12:19:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 12:19:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:19:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-11-19 12:19:17,273 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2024-11-19 12:19:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:19:17,274 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2024-11-19 12:19:17,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 12:19:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-11-19 12:19:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 12:19:17,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:19:17,275 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:19:17,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 12:19:17,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:17,475 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 12:19:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:19:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash -708284553, now seen corresponding path program 1 times [2024-11-19 12:19:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:19:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661196957] [2024-11-19 12:19:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:19:17,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:19:17,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:19:17,478 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:19:17,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 12:19:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:19:57,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 12:19:57,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:19:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 12:19:58,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:19:58,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:19:58,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661196957] [2024-11-19 12:19:58,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661196957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:19:58,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:19:58,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 12:19:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281146095] [2024-11-19 12:19:58,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:19:58,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 12:19:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:19:58,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 12:19:58,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 12:19:58,031 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 12:20:02,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 12:20:06,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 12:20:10,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 12:20:14,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 12:20:18,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 12:20:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:20:18,303 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2024-11-19 12:20:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 12:20:18,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-19 12:20:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:20:18,309 INFO L225 Difference]: With dead ends: 32 [2024-11-19 12:20:18,309 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 12:20:18,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 12:20:18,310 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-19 12:20:18,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-19 12:20:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 12:20:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 12:20:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:20:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-11-19 12:20:18,315 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2024-11-19 12:20:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:20:18,316 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2024-11-19 12:20:18,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 12:20:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-11-19 12:20:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 12:20:18,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:20:18,317 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:20:18,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 12:20:18,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:20:18,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 12:20:18,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:20:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash -481984587, now seen corresponding path program 1 times [2024-11-19 12:20:18,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:20:18,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358380369] [2024-11-19 12:20:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:20:18,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:20:18,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:20:18,520 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:20:18,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process