./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/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/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 68a9d192571af20a9caff88653fa376c42853b2f0586dd5e85037ba45183dc65 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 02:47:40,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:47:40,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:47:40,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:47:40,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:47:40,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:47:40,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:47:40,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:47:40,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:47:40,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:47:40,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:47:40,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:47:40,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:47:40,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:47:40,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:47:40,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:47:40,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:47:40,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:47:40,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:47:40,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:47:40,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:47:40,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:47:40,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:47:40,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:47:40,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:47:40,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:47:40,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:47:40,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:47:40,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:47:40,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:47:40,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:47:40,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:47:40,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:47:40,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:47:40,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:47:40,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:47:40,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:47:40,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:47:40,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:47:40,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:47:40,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:47:40,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-02-14 02:47:40,902 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:47:40,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:47:40,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:47:40,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:47:40,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:47:40,904 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:47:40,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:47:40,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:47:40,905 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:47:40,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:47:40,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:47:40,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:47:40,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:47:40,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 02:47:40,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:47:40,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 02:47:40,907 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-14 02:47:40,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 02:47:40,907 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:47:40,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 02:47:40,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:47:40,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:47:40,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:47:40,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:47:40,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:47:40,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:47:40,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 02:47:40,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 02:47:40,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 02:47:40,909 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:47:40,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 02:47:40,909 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:47:40,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:47:40,910 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:47:40,910 INFO L138 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.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68a9d192571af20a9caff88653fa376c42853b2f0586dd5e85037ba45183dc65 [2023-02-14 02:47:41,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:47:41,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:47:41,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:47:41,111 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:47:41,111 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:47:41,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b.c [2023-02-14 02:47:42,058 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:47:42,196 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:47:42,196 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b.c [2023-02-14 02:47:42,200 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bcfbe26/e64b0b8c64b74c9086c71c747f65402d/FLAGc01d5a8ad [2023-02-14 02:47:42,214 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bcfbe26/e64b0b8c64b74c9086c71c747f65402d [2023-02-14 02:47:42,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:47:42,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:47:42,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:47:42,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:47:42,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:47:42,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327fce36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42, skipping insertion in model container [2023-02-14 02:47:42,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:47:42,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:47:42,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:47:42,343 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:47:42,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:47:42,362 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:47:42,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42 WrapperNode [2023-02-14 02:47:42,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:47:42,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:47:42,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:47:42,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:47:42,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,384 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-14 02:47:42,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:47:42,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:47:42,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:47:42,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:47:42,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,403 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:47:42,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:47:42,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:47:42,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:47:42,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (1/1) ... [2023-02-14 02:47:42,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:47:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:47:42,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 02:47:42,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 02:47:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:47:42,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:47:42,525 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:47:42,527 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:47:42,633 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:47:42,637 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:47:42,637 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-14 02:47:42,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:47:42 BoogieIcfgContainer [2023-02-14 02:47:42,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:47:42,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:47:42,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:47:42,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:47:42,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:47:42" (1/3) ... [2023-02-14 02:47:42,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4525c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:47:42, skipping insertion in model container [2023-02-14 02:47:42,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:47:42" (2/3) ... [2023-02-14 02:47:42,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4525c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:47:42, skipping insertion in model container [2023-02-14 02:47:42,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:47:42" (3/3) ... [2023-02-14 02:47:42,644 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-counterex1b.c [2023-02-14 02:47:42,660 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:47:42,660 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-02-14 02:47:42,707 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:47:42,712 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2270565a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:47:42,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-02-14 02:47:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 24 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) [2023-02-14 02:47:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 02:47:42,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:47:42,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 02:47:42,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-14 02:47:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:47:42,744 INFO L85 PathProgramCache]: Analyzing trace with hash 28700362, now seen corresponding path program 1 times [2023-02-14 02:47:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:47:42,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295191680] [2023-02-14 02:47:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:47:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:47:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:47:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:47:42,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:47:42,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295191680] [2023-02-14 02:47:42,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295191680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:47:42,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:47:42,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:47:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768851717] [2023-02-14 02:47:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:47:42,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 02:47:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:47:42,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 02:47:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 02:47:42,879 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 24 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-02-14 02:47:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:47:42,901 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-02-14 02:47:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 02:47:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-02-14 02:47:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:47:42,908 INFO L225 Difference]: With dead ends: 48 [2023-02-14 02:47:42,908 INFO L226 Difference]: Without dead ends: 21 [2023-02-14 02:47:42,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 02:47:42,915 INFO L413 NwaCegarLoop]: 29 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, 29 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 [2023-02-14 02:47:42,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:47:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-14 02:47:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-14 02:47:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 20 states have internal predecessors, (25), 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) [2023-02-14 02:47:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-02-14 02:47:42,940 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 5 [2023-02-14 02:47:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:47:42,940 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-14 02:47:42,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-02-14 02:47:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-02-14 02:47:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 02:47:42,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:47:42,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:47:42,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 02:47:42,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-14 02:47:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:47:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723093, now seen corresponding path program 1 times [2023-02-14 02:47:42,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:47:42,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158431958] [2023-02-14 02:47:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:47:42,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:47:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:47:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:47:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:47:43,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158431958] [2023-02-14 02:47:43,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158431958] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:47:43,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:47:43,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:47:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295438779] [2023-02-14 02:47:43,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:47:43,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:47:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:47:43,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:47:43,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,003 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-02-14 02:47:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:47:43,015 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2023-02-14 02:47:43,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:47:43,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-02-14 02:47:43,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:47:43,016 INFO L225 Difference]: With dead ends: 21 [2023-02-14 02:47:43,017 INFO L226 Difference]: Without dead ends: 20 [2023-02-14 02:47:43,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,018 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:47:43,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 31 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:47:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-14 02:47:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-14 02:47:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 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) [2023-02-14 02:47:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-02-14 02:47:43,022 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 7 [2023-02-14 02:47:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:47:43,023 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-02-14 02:47:43,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-02-14 02:47:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-02-14 02:47:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 02:47:43,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:47:43,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:47:43,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 02:47:43,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-14 02:47:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:47:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723148, now seen corresponding path program 1 times [2023-02-14 02:47:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:47:43,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618513336] [2023-02-14 02:47:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:47:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:47:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:47:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:47:43,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:47:43,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618513336] [2023-02-14 02:47:43,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618513336] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:47:43,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:47:43,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:47:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197438751] [2023-02-14 02:47:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:47:43,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:47:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:47:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:47:43,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:47:43,070 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-14 02:47:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:47:43,150 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2023-02-14 02:47:43,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 02:47:43,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2023-02-14 02:47:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:47:43,151 INFO L225 Difference]: With dead ends: 33 [2023-02-14 02:47:43,151 INFO L226 Difference]: Without dead ends: 31 [2023-02-14 02:47:43,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:47:43,152 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:47:43,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 26 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:47:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-14 02:47:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-02-14 02:47:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 29 states have internal predecessors, (40), 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) [2023-02-14 02:47:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-02-14 02:47:43,156 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 7 [2023-02-14 02:47:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:47:43,156 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-02-14 02:47:43,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-14 02:47:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-02-14 02:47:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 02:47:43,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:47:43,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:47:43,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 02:47:43,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-14 02:47:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:47:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash 297841103, now seen corresponding path program 1 times [2023-02-14 02:47:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:47:43,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590327242] [2023-02-14 02:47:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:47:43,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:47:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:47:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:47:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:47:43,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590327242] [2023-02-14 02:47:43,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590327242] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:47:43,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:47:43,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:47:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319953717] [2023-02-14 02:47:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:47:43,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:47:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:47:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:47:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,193 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-14 02:47:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:47:43,208 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2023-02-14 02:47:43,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:47:43,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-02-14 02:47:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:47:43,210 INFO L225 Difference]: With dead ends: 30 [2023-02-14 02:47:43,210 INFO L226 Difference]: Without dead ends: 29 [2023-02-14 02:47:43,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,211 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:47:43,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 20 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:47:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-14 02:47:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-14 02:47:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 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) [2023-02-14 02:47:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-02-14 02:47:43,215 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 8 [2023-02-14 02:47:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:47:43,215 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-02-14 02:47:43,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-14 02:47:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-02-14 02:47:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 02:47:43,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:47:43,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:47:43,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 02:47:43,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-14 02:47:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:47:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash 297842801, now seen corresponding path program 1 times [2023-02-14 02:47:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:47:43,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630706706] [2023-02-14 02:47:43,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:47:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:47:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:47:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:47:43,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:47:43,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630706706] [2023-02-14 02:47:43,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630706706] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:47:43,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:47:43,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:47:43,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6747138] [2023-02-14 02:47:43,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:47:43,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:47:43,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:47:43,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:47:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,256 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-14 02:47:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:47:43,272 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-14 02:47:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:47:43,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-02-14 02:47:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:47:43,273 INFO L225 Difference]: With dead ends: 29 [2023-02-14 02:47:43,273 INFO L226 Difference]: Without dead ends: 28 [2023-02-14 02:47:43,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,274 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:47:43,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:47:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-14 02:47:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-14 02:47:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 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) [2023-02-14 02:47:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-02-14 02:47:43,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 8 [2023-02-14 02:47:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:47:43,279 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-02-14 02:47:43,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-14 02:47:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-02-14 02:47:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 02:47:43,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:47:43,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:47:43,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 02:47:43,280 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-14 02:47:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:47:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash -884348300, now seen corresponding path program 1 times [2023-02-14 02:47:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:47:43,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248325558] [2023-02-14 02:47:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:47:43,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:47:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:47:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:47:43,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:47:43,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248325558] [2023-02-14 02:47:43,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248325558] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:47:43,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:47:43,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:47:43,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861309542] [2023-02-14 02:47:43,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:47:43,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:47:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:47:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:47:43,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,302 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-02-14 02:47:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:47:43,310 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2023-02-14 02:47:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:47:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2023-02-14 02:47:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:47:43,311 INFO L225 Difference]: With dead ends: 56 [2023-02-14 02:47:43,312 INFO L226 Difference]: Without dead ends: 30 [2023-02-14 02:47:43,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,313 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:47:43,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:47:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-14 02:47:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-14 02:47:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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) [2023-02-14 02:47:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-02-14 02:47:43,317 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2023-02-14 02:47:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:47:43,317 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-02-14 02:47:43,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-02-14 02:47:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-02-14 02:47:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 02:47:43,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:47:43,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:47:43,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 02:47:43,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-14 02:47:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:47:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash -884350222, now seen corresponding path program 1 times [2023-02-14 02:47:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:47:43,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649629351] [2023-02-14 02:47:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:47:43,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:47:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:47:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:47:43,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:47:43,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649629351] [2023-02-14 02:47:43,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649629351] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:47:43,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:47:43,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:47:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879530977] [2023-02-14 02:47:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:47:43,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:47:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:47:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:47:43,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,381 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-02-14 02:47:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:47:43,405 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2023-02-14 02:47:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:47:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2023-02-14 02:47:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:47:43,407 INFO L225 Difference]: With dead ends: 56 [2023-02-14 02:47:43,407 INFO L226 Difference]: Without dead ends: 55 [2023-02-14 02:47:43,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:47:43,408 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:47:43,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 26 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:47:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-14 02:47:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2023-02-14 02:47:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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) [2023-02-14 02:47:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-02-14 02:47:43,414 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2023-02-14 02:47:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:47:43,414 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-02-14 02:47:43,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-02-14 02:47:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-02-14 02:47:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 02:47:43,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:47:43,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:47:43,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 02:47:43,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-02-14 02:47:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:47:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1969855908, now seen corresponding path program 1 times [2023-02-14 02:47:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:47:43,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203245826] [2023-02-14 02:47:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:47:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:47:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 02:47:43,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 02:47:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 02:47:43,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 02:47:43,463 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 02:47:43,465 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-02-14 02:47:43,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-02-14 02:47:43,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-02-14 02:47:43,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-02-14 02:47:43,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-02-14 02:47:43,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-02-14 02:47:43,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 02:47:43,473 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:47:43,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 02:47:43,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 02:47:43 BoogieIcfgContainer [2023-02-14 02:47:43,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 02:47:43,489 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 02:47:43,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 02:47:43,489 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 02:47:43,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:47:42" (3/4) ... [2023-02-14 02:47:43,491 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 02:47:43,515 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 02:47:43,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 02:47:43,515 INFO L158 Benchmark]: Toolchain (without parser) took 1297.83ms. Allocated memory is still 125.8MB. Free memory was 82.6MB in the beginning and 43.6MB in the end (delta: 39.0MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2023-02-14 02:47:43,515 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:47:43,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.65ms. Allocated memory is still 125.8MB. Free memory was 82.1MB in the beginning and 73.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 02:47:43,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.29ms. Allocated memory is still 125.8MB. Free memory was 73.0MB in the beginning and 71.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 02:47:43,516 INFO L158 Benchmark]: Boogie Preprocessor took 21.09ms. Allocated memory is still 125.8MB. Free memory was 71.6MB in the beginning and 70.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:47:43,516 INFO L158 Benchmark]: RCFGBuilder took 232.03ms. Allocated memory is still 125.8MB. Free memory was 70.4MB in the beginning and 60.8MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 02:47:43,517 INFO L158 Benchmark]: TraceAbstraction took 848.75ms. Allocated memory is still 125.8MB. Free memory was 60.0MB in the beginning and 45.0MB in the end (delta: 15.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-02-14 02:47:43,522 INFO L158 Benchmark]: Witness Printer took 25.58ms. Allocated memory is still 125.8MB. Free memory was 45.0MB in the beginning and 43.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 02:47:43,523 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.65ms. Allocated memory is still 125.8MB. Free memory was 82.1MB in the beginning and 73.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.29ms. Allocated memory is still 125.8MB. Free memory was 73.0MB in the beginning and 71.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.09ms. Allocated memory is still 125.8MB. Free memory was 71.6MB in the beginning and 70.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 232.03ms. Allocated memory is still 125.8MB. Free memory was 70.4MB in the beginning and 60.8MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 848.75ms. Allocated memory is still 125.8MB. Free memory was 60.0MB in the beginning and 45.0MB in the end (delta: 15.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 25.58ms. Allocated memory is still 125.8MB. Free memory was 45.0MB in the beginning and 43.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x, y, n; [L15] n = __VERIFIER_nondet_int() [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] COND TRUE x >= 0 VAL [n=2147483647, x=1, y=2147483647] [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=0, n=2147483647, x=1, y=2147483647, y >= 0 && __VERIFIER_nondet_int() != 0=0] [L19] COND FALSE !(y >= 0 && __VERIFIER_nondet_int() != 0) [L22] EXPR x - 1 [L22] x = x - 1 VAL [n=2147483647, x=0, y=2147483647] [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] y <= n && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=1, n=2147483647, x=0, y=2147483647, y <= n && __VERIFIER_nondet_int() != 0=1] [L23] COND TRUE y <= n && __VERIFIER_nondet_int() != 0 [L24] y + 1 VAL [n=2147483647, x=0, y=2147483647] - UnprovableResult [Line: 20]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 133 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2023-02-14 02:47:43,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)