./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/neural-networks/softmax_8_safe.c-amalgamation.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:45:13,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:45:13,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:45:13,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:45:13,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:45:13,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:45:13,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:45:13,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:45:13,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:45:13,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:45:13,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:45:13,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:45:13,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:45:13,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:45:13,795 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:45:13,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:45:13,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:45:13,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:45:13,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:45:13,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:45:13,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:45:13,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:45:13,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:45:13,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:45:13,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:45:13,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:45:13,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:45:13,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:45:13,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:45:13,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:45:13,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:45:13,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:45:13,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:45:13,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:45:13,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:45:13,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:45:13,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:45:13,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:45:13,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:45:13,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:45:13,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:45:13,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:45:13,807 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 [2024-11-09 21:45:14,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:45:14,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:45:14,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:45:14,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:45:14,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:45:14,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2024-11-09 21:45:15,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:45:15,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:45:15,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2024-11-09 21:45:15,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e86a1717/2007b6665df54a8b98c77b36eecc3766/FLAG3d6a0a9c8 [2024-11-09 21:45:15,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e86a1717/2007b6665df54a8b98c77b36eecc3766 [2024-11-09 21:45:15,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:45:15,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:45:15,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:45:15,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:45:15,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:45:15,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:45:15" (1/1) ... [2024-11-09 21:45:15,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c60796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:15, skipping insertion in model container [2024-11-09 21:45:15,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:45:15" (1/1) ... [2024-11-09 21:45:15,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:45:16,447 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: isnan 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.lambda$150(StandardFunctionHandler.java:621) 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:1611) 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:2564) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:791) 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:2564) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2564) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1761) 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:1167) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1150) 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:1638) 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:3519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2508) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:642) 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-09 21:45:16,455 INFO L158 Benchmark]: Toolchain (without parser) took 604.49ms. Allocated memory is still 157.3MB. Free memory was 125.8MB in the beginning and 108.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 21:45:16,456 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:45:16,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.77ms. Allocated memory is still 157.3MB. Free memory was 125.8MB in the beginning and 108.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 21:45:16,457 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.27ms. Allocated memory is still 157.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.77ms. Allocated memory is still 157.3MB. Free memory was 125.8MB in the beginning and 108.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. 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: isnan de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan: 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/neural-networks/softmax_8_safe.c-amalgamation.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:45:18,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:45:18,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 21:45:18,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:45:18,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:45:18,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:45:18,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:45:18,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:45:18,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:45:18,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:45:18,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:45:18,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:45:18,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:45:18,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:45:18,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:45:18,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:45:18,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:45:18,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:45:18,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:45:18,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:45:18,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:45:18,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:45:18,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:45:18,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 21:45:18,584 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 21:45:18,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:45:18,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 21:45:18,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:45:18,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:45:18,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:45:18,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:45:18,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:45:18,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:45:18,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:45:18,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:45:18,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:45:18,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:45:18,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:45:18,588 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 21:45:18,588 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 21:45:18,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:45:18,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:45:18,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:45:18,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:45:18,589 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 [2024-11-09 21:45:18,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:45:18,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:45:18,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:45:18,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:45:18,937 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:45:18,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2024-11-09 21:45:20,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:45:20,739 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:45:20,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2024-11-09 21:45:20,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bda41ad/b26b2a269d5644d59588d25c349a5f31/FLAG3290f20aa [2024-11-09 21:45:20,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bda41ad/b26b2a269d5644d59588d25c349a5f31 [2024-11-09 21:45:20,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:45:20,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:45:20,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:45:20,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:45:20,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:45:20,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:45:20" (1/1) ... [2024-11-09 21:45:20,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ae038b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:20, skipping insertion in model container [2024-11-09 21:45:20,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:45:20" (1/1) ... [2024-11-09 21:45:20,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:45:21,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i[63746,63759] [2024-11-09 21:45:21,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:45:21,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:45:21,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i[63746,63759] [2024-11-09 21:45:21,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:45:21,815 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:45:21,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21 WrapperNode [2024-11-09 21:45:21,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:45:21,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:45:21,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:45:21,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:45:21,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,900 INFO L138 Inliner]: procedures = 562, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2024-11-09 21:45:21,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:45:21,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:45:21,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:45:21,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:45:21,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,938 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 4, 7, 12]. 48 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7, 0]. The 6 writes are split as follows [0, 2, 0, 4]. [2024-11-09 21:45:21,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:45:21,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:45:21,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:45:21,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:45:21,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (1/1) ... [2024-11-09 21:45:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:45:21,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:45:21,998 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-09 21:45:22,001 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-09 21:45:22,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 21:45:22,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 21:45:22,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 21:45:22,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 21:45:22,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 21:45:22,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 21:45:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 21:45:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 21:45:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 21:45:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:45:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:45:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:45:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 21:45:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 21:45:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 21:45:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 21:45:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 21:45:22,172 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:45:22,175 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:45:23,119 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L863: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset; [2024-11-09 21:45:23,129 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-09 21:45:23,129 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:45:23,142 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:45:23,142 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:45:23,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:45:23 BoogieIcfgContainer [2024-11-09 21:45:23,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:45:23,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:45:23,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:45:23,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:45:23,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:45:20" (1/3) ... [2024-11-09 21:45:23,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb77a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:45:23, skipping insertion in model container [2024-11-09 21:45:23,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:21" (2/3) ... [2024-11-09 21:45:23,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb77a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:45:23, skipping insertion in model container [2024-11-09 21:45:23,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:45:23" (3/3) ... [2024-11-09 21:45:23,151 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_8_safe.c-amalgamation.i [2024-11-09 21:45:23,166 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:45:23,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 21:45:23,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:45:23,236 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;@58e95d3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:45:23,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 21:45:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 21:45:23,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:23,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:23,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash -759826271, now seen corresponding path program 1 times [2024-11-09 21:45:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814257013] [2024-11-09 21:45:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:23,266 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-09 21:45:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:23,268 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-09 21:45:23,269 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-09 21:45:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:23,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 21:45:23,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:23,464 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-09 21:45:23,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:45:23,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:23,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814257013] [2024-11-09 21:45:23,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814257013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:45:23,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:45:23,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 21:45:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809656710] [2024-11-09 21:45:23,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:45:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 21:45:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 21:45:23,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:45:23,496 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:23,507 INFO L93 Difference]: Finished difference Result 61 states and 86 transitions. [2024-11-09 21:45:23,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 21:45:23,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 21:45:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:23,514 INFO L225 Difference]: With dead ends: 61 [2024-11-09 21:45:23,515 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 21:45:23,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:45:23,520 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:23,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:45:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 21:45:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 21:45:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 21:45:23,543 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2024-11-09 21:45:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:23,543 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 21:45:23,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 21:45:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 21:45:23,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:23,544 INFO L215 NwaCegarLoop]: trace histogram [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-09 21:45:23,550 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-09 21:45:23,745 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-09 21:45:23,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:23,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1677501591, now seen corresponding path program 1 times [2024-11-09 21:45:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:23,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041595248] [2024-11-09 21:45:23,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:23,748 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-09 21:45:23,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:23,751 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-09 21:45:23,752 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-09 21:45:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:23,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 21:45:23,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:23,986 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-09 21:45:23,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:45:23,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:23,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041595248] [2024-11-09 21:45:23,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041595248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:45:23,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:45:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:45:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501022812] [2024-11-09 21:45:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:45:23,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:45:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:23,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:45:23,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:45:23,994 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:24,515 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-09 21:45:24,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:45:24,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 21:45:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:24,517 INFO L225 Difference]: With dead ends: 46 [2024-11-09 21:45:24,517 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 21:45:24,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-09 21:45:24,518 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:24,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 21:45:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 21:45:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 21:45:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-09 21:45:24,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2024-11-09 21:45:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:24,525 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-09 21:45:24,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-09 21:45:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 21:45:24,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:24,527 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-09 21:45:24,534 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 (3)] Ended with exit code 0 [2024-11-09 21:45:24,727 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-09 21:45:24,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:24,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1946099559, now seen corresponding path program 1 times [2024-11-09 21:45:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:24,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885945259] [2024-11-09 21:45:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:24,730 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-09 21:45:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:24,732 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-09 21:45:24,740 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-09 21:45:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:24,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 21:45:24,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:45:24,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:45:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:45:25,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885945259] [2024-11-09 21:45:25,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885945259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:45:25,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 21:45:25,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 21:45:25,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740182842] [2024-11-09 21:45:25,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 21:45:25,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:45:25,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:25,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:45:25,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:45:25,050 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:25,871 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-11-09 21:45:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 21:45:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 21:45:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:25,873 INFO L225 Difference]: With dead ends: 52 [2024-11-09 21:45:25,873 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 21:45:25,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:45:25,875 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:25,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 21:45:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 21:45:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 21:45:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-09 21:45:25,880 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-11-09 21:45:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:25,881 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-09 21:45:25,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-09 21:45:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 21:45:25,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:25,882 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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-09 21:45:25,892 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 (4)] Ended with exit code 0 [2024-11-09 21:45:26,082 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-09 21:45:26,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:26,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1983145373, now seen corresponding path program 2 times [2024-11-09 21:45:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:26,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778830720] [2024-11-09 21:45:26,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:45:26,085 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-09 21:45:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:26,089 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-09 21:45:26,092 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-09 21:45:26,252 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 21:45:26,253 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:45:26,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 21:45:26,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 21:45:26,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:45:26,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:26,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778830720] [2024-11-09 21:45:26,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778830720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:45:26,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:45:26,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:45:26,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421132927] [2024-11-09 21:45:26,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:45:26,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:45:26,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:26,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:45:26,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:45:26,371 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:27,131 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-09 21:45:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:45:27,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 21:45:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:27,133 INFO L225 Difference]: With dead ends: 53 [2024-11-09 21:45:27,134 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 21:45:27,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:45:27,135 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:27,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 59 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 21:45:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 21:45:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-09 21:45:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-09 21:45:27,146 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 36 [2024-11-09 21:45:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:27,147 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-09 21:45:27,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-09 21:45:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 21:45:27,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:27,149 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:27,158 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 (5)] Ended with exit code 0 [2024-11-09 21:45:27,350 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-09 21:45:27,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2048579932, now seen corresponding path program 1 times [2024-11-09 21:45:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:27,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669357084] [2024-11-09 21:45:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:27,352 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-09 21:45:27,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:27,355 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-09 21:45:27,357 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-09 21:45:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:27,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 21:45:27,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 21:45:27,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:45:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 21:45:27,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669357084] [2024-11-09 21:45:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669357084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:45:27,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 21:45:27,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 21:45:27,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064100260] [2024-11-09 21:45:27,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 21:45:27,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 21:45:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:27,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 21:45:27,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 21:45:27,962 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:30,753 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2024-11-09 21:45:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 21:45:30,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 21:45:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:30,755 INFO L225 Difference]: With dead ends: 69 [2024-11-09 21:45:30,757 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 21:45:30,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-09 21:45:30,758 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:30,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 21:45:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 21:45:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 21:45:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-09 21:45:30,771 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 41 [2024-11-09 21:45:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:30,771 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-09 21:45:30,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-09 21:45:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 21:45:30,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:30,773 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:30,786 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 (6)] Ended with exit code 0 [2024-11-09 21:45:30,973 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-09 21:45:30,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:30,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:30,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1091856289, now seen corresponding path program 2 times [2024-11-09 21:45:30,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:30,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111672895] [2024-11-09 21:45:30,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:45:30,976 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-09 21:45:30,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:30,977 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-09 21:45:30,978 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-09 21:45:31,126 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 21:45:31,126 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:45:31,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 21:45:31,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:45:31,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:45:31,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111672895] [2024-11-09 21:45:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111672895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:45:31,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:45:31,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:45:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677140147] [2024-11-09 21:45:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:45:31,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:45:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:45:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:45:31,153 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:31,250 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-11-09 21:45:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:45:31,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-09 21:45:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:31,252 INFO L225 Difference]: With dead ends: 63 [2024-11-09 21:45:31,252 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 21:45:31,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-09 21:45:31,255 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:31,255 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.1s Time] [2024-11-09 21:45:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 21:45:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 21:45:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-09 21:45:31,265 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 56 [2024-11-09 21:45:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:31,266 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-09 21:45:31,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-09 21:45:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 21:45:31,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:31,268 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:31,275 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 (7)] Ended with exit code 0 [2024-11-09 21:45:31,472 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-09 21:45:31,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1239875360, now seen corresponding path program 1 times [2024-11-09 21:45:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205545173] [2024-11-09 21:45:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:31,474 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-09 21:45:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:31,475 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-09 21:45:31,476 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 [2024-11-09 21:45:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:32,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 21:45:32,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:45:32,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:45:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:45:32,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205545173] [2024-11-09 21:45:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205545173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:45:32,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 21:45:32,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 21:45:32,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86014570] [2024-11-09 21:45:32,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 21:45:32,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:45:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:32,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:45:32,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:45:32,283 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:32,464 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-09 21:45:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:45:32,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-09 21:45:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:32,465 INFO L225 Difference]: With dead ends: 69 [2024-11-09 21:45:32,465 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 21:45:32,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:45:32,466 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:32,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 21:45:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 21:45:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 21:45:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-09 21:45:32,481 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 58 [2024-11-09 21:45:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-09 21:45:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-09 21:45:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 21:45:32,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:32,482 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:32,516 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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 21:45:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-09 21:45:32,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1113903331, now seen corresponding path program 2 times [2024-11-09 21:45:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063030601] [2024-11-09 21:45:32,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:45:32,685 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-09 21:45:32,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:32,688 INFO L229 MonitoredProcess]: Starting monitored process 9 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-09 21:45:32,692 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 (9)] Waiting until timeout for monitored process [2024-11-09 21:45:37,105 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:45:37,105 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 21:45:37,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 21:45:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 21:45:38,321 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 21:45:38,321 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 21:45:38,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 21:45:38,382 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 21:45:38,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-09 21:45:38,528 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2024-11-09 21:45:38,588 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 21:45:38,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:45:38 BoogieIcfgContainer [2024-11-09 21:45:38,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 21:45:38,592 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 21:45:38,592 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 21:45:38,592 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 21:45:38,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:45:23" (3/4) ... [2024-11-09 21:45:38,595 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 21:45:38,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 21:45:38,597 INFO L158 Benchmark]: Toolchain (without parser) took 17821.31ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 28.7MB in the beginning and 25.9MB in the end (delta: 2.8MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-09 21:45:38,597 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 52.4MB. Free memory was 35.0MB in the beginning and 35.0MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:45:38,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1039.79ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 28.4MB in the beginning and 64.4MB in the end (delta: -36.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-09 21:45:38,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.54ms. Allocated memory is still 90.2MB. Free memory was 64.4MB in the beginning and 61.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 21:45:38,599 INFO L158 Benchmark]: Boogie Preprocessor took 58.06ms. Allocated memory is still 90.2MB. Free memory was 61.3MB in the beginning and 58.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 21:45:38,600 INFO L158 Benchmark]: IcfgBuilder took 1179.34ms. Allocated memory is still 90.2MB. Free memory was 58.7MB in the beginning and 41.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 21:45:38,600 INFO L158 Benchmark]: TraceAbstraction took 15446.18ms. Allocated memory is still 90.2MB. Free memory was 40.9MB in the beginning and 26.6MB in the end (delta: 14.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-09 21:45:38,600 INFO L158 Benchmark]: Witness Printer took 4.91ms. Allocated memory is still 90.2MB. Free memory was 26.6MB in the beginning and 25.9MB in the end (delta: 671.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:45:38,602 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.95ms. Allocated memory is still 52.4MB. Free memory was 35.0MB in the beginning and 35.0MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1039.79ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 28.4MB in the beginning and 64.4MB in the end (delta: -36.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.54ms. Allocated memory is still 90.2MB. Free memory was 64.4MB in the beginning and 61.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.06ms. Allocated memory is still 90.2MB. Free memory was 61.3MB in the beginning and 58.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1179.34ms. Allocated memory is still 90.2MB. Free memory was 58.7MB in the beginning and 41.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15446.18ms. Allocated memory is still 90.2MB. Free memory was 40.9MB in the beginning and 26.6MB in the end (delta: 14.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Witness Printer took 4.91ms. Allocated memory is still 90.2MB. Free memory was 26.6MB in the beginning and 25.9MB in the end (delta: 671.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 878]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of expf at line 854, overapproximation of __builtin_isinf_sign at line 871. Possible FailurePath: [L863] float x[4], y[4]; [L864] x[0] = __VERIFIER_nondet_float() [L865] x[1] = __VERIFIER_nondet_float() [L866] x[2] = __VERIFIER_nondet_float() [L867] x[3] = __VERIFIER_nondet_float() [L868] EXPR x[0] [L868] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L869] EXPR x[1] [L869] COND FALSE !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1]))) [L870] EXPR x[2] [L870] COND FALSE !(!(!__builtin_isnan (x[2]) && !__builtin_isinf_sign (x[2]))) [L871] EXPR x[3] [L871] COND FALSE !(!(!__builtin_isnan (x[3]) && !__builtin_isinf_sign (x[3]))) [L872] CALL softmax(x, y, 4) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=0.0, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=1, max=2.0, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=2, max=2.0, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=2, max=36893496943512125000, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=3, max=36893496943512125000, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=3, max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=4, max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=1, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n VAL [i=1, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=2, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n VAL [i=2, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=3, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n VAL [i=3, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=4, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=1, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=2, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=3, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=4, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, sum=0.0, x={-2147483648:0}, y={3:0}] [L872] RET softmax(x, y, 4) [L873] int i; [L874] float sum = 0.0f; [L875] i = 0 VAL [i=0, sum=0.0, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=1, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=2, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=3, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=4, sum=NaN, y={3:0}] [L875] COND FALSE !(i < 4) VAL [sum=NaN, y={3:0}] [L877] float diff = fabsf(sum - 1.0f); VAL [diff=NaN, y={3:0}] [L878] COND TRUE !(__builtin_islessequal(diff, 1e-5f)) VAL [y={3:0}] [L878] reach_error() VAL [y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 208 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 327 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 742 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 250/262 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 21:45:38,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample