./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:47:31,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:47:31,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:47:31,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:47:31,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:47:31,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:47:31,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:47:31,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:47:31,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:47:31,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:47:31,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:47:31,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:47:31,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:47:31,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:47:31,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:47:31,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:47:31,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:47:31,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:47:31,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:47:31,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:47:31,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:47:31,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:47:31,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:47:31,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:47:31,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:47:31,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:47:31,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:47:31,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:47:31,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:47:31,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:47:31,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:47:31,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:47:31,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:47:31,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:47:31,547 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 [2024-11-07 07:47:31,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:47:31,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:47:31,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:47:31,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:47:31,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:47:31,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-11-07 07:47:33,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:47:33,512 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:47:33,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-11-07 07:47:33,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f79487a87/901d8db593734b0d9ec22f95d5c42c86/FLAG6e691e674 [2024-11-07 07:47:33,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f79487a87/901d8db593734b0d9ec22f95d5c42c86 [2024-11-07 07:47:33,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:47:33,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:47:33,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:47:33,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:47:33,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:47:33,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556b8b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33, skipping insertion in model container [2024-11-07 07:47:33,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:47:33,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-11-07 07:47:33,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:47:33,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:47:33,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-11-07 07:47:33,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:47:33,779 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:47:33,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33 WrapperNode [2024-11-07 07:47:33,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:47:33,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:47:33,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:47:33,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:47:33,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,811 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-07 07:47:33,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:47:33,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:47:33,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:47:33,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:47:33,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,837 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:47:33,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:47:33,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:47:33,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:47:33,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:47:33,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (1/1) ... [2024-11-07 07:47:33,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:47:33,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:47:33,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:47:33,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:47:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:47:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:47:33,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:47:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:47:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:47:33,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:47:33,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:47:33,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:47:34,204 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 07:47:34,205 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:47:34,215 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:47:34,217 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:47:34,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:47:34 BoogieIcfgContainer [2024-11-07 07:47:34,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:47:34,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:47:34,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:47:34,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:47:34,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:47:33" (1/3) ... [2024-11-07 07:47:34,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275110d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:47:34, skipping insertion in model container [2024-11-07 07:47:34,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:33" (2/3) ... [2024-11-07 07:47:34,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275110d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:47:34, skipping insertion in model container [2024-11-07 07:47:34,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:47:34" (3/3) ... [2024-11-07 07:47:34,224 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-36.i [2024-11-07 07:47:34,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:47:34,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:47:34,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:47:34,274 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;@4d004ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:47:34,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:47:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:47:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 07:47:34,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:34,322 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:34,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:34,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1637717661, now seen corresponding path program 1 times [2024-11-07 07:47:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:34,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862788825] [2024-11-07 07:47:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:34,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:47:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:47:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:47:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:47:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:47:34,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862788825] [2024-11-07 07:47:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862788825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:34,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:34,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:47:34,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109237022] [2024-11-07 07:47:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:34,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:47:34,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:47:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:47:34,683 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 07:47:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:34,715 INFO L93 Difference]: Finished difference Result 109 states and 182 transitions. [2024-11-07 07:47:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:47:34,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2024-11-07 07:47:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:34,722 INFO L225 Difference]: With dead ends: 109 [2024-11-07 07:47:34,722 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 07:47:34,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-07 07:47:34,726 INFO L432 NwaCegarLoop]: 79 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, 79 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-07 07:47:34,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:47:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 07:47:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 07:47:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:47:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-07 07:47:34,768 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 105 [2024-11-07 07:47:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:34,769 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-07 07:47:34,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 07:47:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-07 07:47:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 07:47:34,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:34,774 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:34,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:47:34,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:34,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:34,775 INFO L85 PathProgramCache]: Analyzing trace with hash 127579805, now seen corresponding path program 1 times [2024-11-07 07:47:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:34,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003049762] [2024-11-07 07:47:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:47:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:47:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:47:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:47:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:47:35,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:35,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003049762] [2024-11-07 07:47:35,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003049762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:35,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:35,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:47:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299536866] [2024-11-07 07:47:35,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:35,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:47:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:35,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:47:35,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:47:35,082 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:35,121 INFO L93 Difference]: Finished difference Result 106 states and 157 transitions. [2024-11-07 07:47:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:47:35,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-07 07:47:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:35,123 INFO L225 Difference]: With dead ends: 106 [2024-11-07 07:47:35,123 INFO L226 Difference]: Without dead ends: 55 [2024-11-07 07:47:35,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-07 07:47:35,124 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:35,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:47:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-07 07:47:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-07 07:47:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:47:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2024-11-07 07:47:35,131 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 105 [2024-11-07 07:47:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:35,133 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2024-11-07 07:47:35,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2024-11-07 07:47:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 07:47:35,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:35,136 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:35,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:47:35,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:35,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash 828644383, now seen corresponding path program 1 times [2024-11-07 07:47:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660387972] [2024-11-07 07:47:35,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:47:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:47:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:47:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:47:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:47:35,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:35,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660387972] [2024-11-07 07:47:35,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660387972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:35,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:35,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:47:35,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580436830] [2024-11-07 07:47:35,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:35,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:47:35,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:35,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:47:35,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:47:35,497 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:35,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:35,704 INFO L93 Difference]: Finished difference Result 159 states and 234 transitions. [2024-11-07 07:47:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:47:35,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-07 07:47:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:35,708 INFO L225 Difference]: With dead ends: 159 [2024-11-07 07:47:35,708 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 07:47:35,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:47:35,709 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:35,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 201 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:47:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 07:47:35,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2024-11-07 07:47:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 07:47:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-11-07 07:47:35,737 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 105 [2024-11-07 07:47:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:35,738 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-11-07 07:47:35,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-11-07 07:47:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 07:47:35,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:35,743 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:47:35,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:35,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash -46810809, now seen corresponding path program 1 times [2024-11-07 07:47:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985611949] [2024-11-07 07:47:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:47:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:47:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:47:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:47:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:47:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985611949] [2024-11-07 07:47:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985611949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:47:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773431135] [2024-11-07 07:47:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:36,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:47:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:47:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:47:36,263 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:36,516 INFO L93 Difference]: Finished difference Result 265 states and 394 transitions. [2024-11-07 07:47:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:47:36,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-11-07 07:47:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:36,519 INFO L225 Difference]: With dead ends: 265 [2024-11-07 07:47:36,519 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 07:47:36,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:47:36,520 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 136 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:36,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 422 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:47:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 07:47:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 112. [2024-11-07 07:47:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 07:47:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 168 transitions. [2024-11-07 07:47:36,537 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 168 transitions. Word has length 106 [2024-11-07 07:47:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:36,537 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 168 transitions. [2024-11-07 07:47:36,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 168 transitions. [2024-11-07 07:47:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 07:47:36,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:36,542 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:36,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:47:36,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:36,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1264021694, now seen corresponding path program 1 times [2024-11-07 07:47:36,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305007283] [2024-11-07 07:47:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:47:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:47:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:47:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:47:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:47:37,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:37,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305007283] [2024-11-07 07:47:37,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305007283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:37,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:37,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:47:37,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60124821] [2024-11-07 07:47:37,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:37,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:47:37,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:37,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:47:37,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:47:37,161 INFO L87 Difference]: Start difference. First operand 112 states and 168 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:37,442 INFO L93 Difference]: Finished difference Result 257 states and 373 transitions. [2024-11-07 07:47:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:47:37,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-07 07:47:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:37,444 INFO L225 Difference]: With dead ends: 257 [2024-11-07 07:47:37,445 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 07:47:37,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:47:37,445 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 118 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:37,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 378 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:47:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 07:47:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 158. [2024-11-07 07:47:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 108 states have internal predecessors, (138), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 07:47:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-11-07 07:47:37,476 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 107 [2024-11-07 07:47:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:37,476 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-07 07:47:37,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2024-11-07 07:47:37,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 07:47:37,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:37,480 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:37,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:47:37,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:37,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:37,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1241283900, now seen corresponding path program 1 times [2024-11-07 07:47:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318090751] [2024-11-07 07:47:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:47:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:47:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:47:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:47:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:47:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:47:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:47:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:47:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:47:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:47:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:47:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:47:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:47:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:47:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:47:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:47:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:47:37,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:47:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318090751] [2024-11-07 07:47:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318090751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:37,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:37,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:47:37,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5817448] [2024-11-07 07:47:37,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:37,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:47:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:47:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:47:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:47:37,632 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:37,653 INFO L93 Difference]: Finished difference Result 252 states and 363 transitions. [2024-11-07 07:47:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:47:37,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-11-07 07:47:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:37,656 INFO L225 Difference]: With dead ends: 252 [2024-11-07 07:47:37,656 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 07:47:37,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-07 07:47:37,657 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:47:37,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:47:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 07:47:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-07 07:47:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.164835164835165) internal successors, (106), 92 states have internal predecessors, (106), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 07:47:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2024-11-07 07:47:37,682 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 108 [2024-11-07 07:47:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:37,682 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2024-11-07 07:47:37,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:47:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2024-11-07 07:47:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 07:47:37,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:37,683 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:37,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:47:37,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1079678448, now seen corresponding path program 1 times [2024-11-07 07:47:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:47:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414008890] [2024-11-07 07:47:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:47:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:47:37,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:47:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:47:37,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:47:37,754 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:47:37,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:47:37,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:47:37,757 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:37,797 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:47:37,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:47:37 BoogieIcfgContainer [2024-11-07 07:47:37,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:47:37,799 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:47:37,799 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:47:37,800 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:47:37,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:47:34" (3/4) ... [2024-11-07 07:47:37,802 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:47:37,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:47:37,803 INFO L158 Benchmark]: Toolchain (without parser) took 4261.63ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.6MB in the beginning and 59.6MB in the end (delta: 17.0MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2024-11-07 07:47:37,803 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:47:37,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.60ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 63.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:47:37,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.89ms. Allocated memory is still 100.7MB. Free memory was 63.9MB in the beginning and 62.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:47:37,803 INFO L158 Benchmark]: Boogie Preprocessor took 43.94ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 60.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:47:37,803 INFO L158 Benchmark]: RCFGBuilder took 358.67ms. Allocated memory is still 100.7MB. Free memory was 59.9MB in the beginning and 44.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:47:37,803 INFO L158 Benchmark]: TraceAbstraction took 3580.46ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 43.8MB in the beginning and 59.6MB in the end (delta: -15.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-11-07 07:47:37,803 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 125.8MB. Free memory was 59.6MB in the beginning and 59.6MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:47:37,804 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.25ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.60ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 63.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.89ms. Allocated memory is still 100.7MB. Free memory was 63.9MB in the beginning and 62.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.94ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 60.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 358.67ms. Allocated memory is still 100.7MB. Free memory was 59.9MB in the beginning and 44.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3580.46ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 43.8MB in the beginning and 59.6MB in the end (delta: -15.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 125.8MB. Free memory was 59.6MB in the beginning and 59.6MB in the end (delta: 19.6kB). 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: 19]: 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 to_int at line 100, overapproximation of shiftRight at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] signed long int var_1_3 = 999999999; [L24] unsigned char var_1_4 = 0; [L25] signed long int var_1_5 = 4; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_9 = 1; [L28] signed long int var_1_10 = 64; [L29] signed long int var_1_11 = 9; [L30] signed long int var_1_12 = 199; [L31] signed long int var_1_13 = 3; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_16 = 2; [L34] unsigned char last_1_var_1_14 = 1; VAL [isInitial=0, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=999999999, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=999999999, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L71] var_1_3 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L73] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L74] var_1_4 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L77] var_1_5 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L83] var_1_11 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L85] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L86] var_1_12 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L88] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L89] var_1_13 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L90] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L108] RET updateVariables() [L109] CALL step() [L38] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L38] COND TRUE (last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14) [L39] var_1_7 = (var_1_4 || var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L41] COND FALSE !(var_1_13 == (- var_1_12)) [L48] var_1_14 = 0 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L50] COND TRUE var_1_5 > var_1_3 [L51] var_1_10 = 4.6 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L55] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_14=1, stepLocal_0=0, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L56] COND FALSE !(stepLocal_0 && var_1_7) [L67] var_1_1 = var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100-L101] return (((((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1)) && ((var_1_5 > var_1_3) ? (var_1_10 == ((signed long int) 4.6)) : (var_1_10 == ((signed long int) ((((var_1_11) > (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11) : (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))))))))) && ((var_1_13 == (- var_1_12)) ? ((var_1_7 && var_1_7) ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_16))) : (var_1_14 == ((unsigned char) 0))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=1000000000, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, var_1_10=1000000000, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 1365 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 674 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=5, InterpolantAutomatonStates: 23, 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, 6 MinimizatonAttempts, 150 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 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-07 07:47:37,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:47:39,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:47:39,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:47:39,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:47:39,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:47:39,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:47:39,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:47:39,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:47:39,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:47:39,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:47:39,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:47:39,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:47:39,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:47:39,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:47:39,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:47:39,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:47:39,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:47:39,902 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:47:39,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:47:39,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:47:39,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:47:39,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:47:39,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:47:39,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:47:39,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:47:39,905 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 [2024-11-07 07:47:40,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:47:40,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:47:40,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:47:40,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:47:40,143 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:47:40,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-11-07 07:47:41,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:47:41,577 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:47:41,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-11-07 07:47:41,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23372482f/76e10feeeb474cada7289b4d12c6f909/FLAGb61666d9e [2024-11-07 07:47:41,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23372482f/76e10feeeb474cada7289b4d12c6f909 [2024-11-07 07:47:41,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:47:41,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:47:41,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:47:41,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:47:41,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:47:41,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c47d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41, skipping insertion in model container [2024-11-07 07:47:41,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:47:41,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-11-07 07:47:41,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:47:41,721 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:47:41,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-11-07 07:47:41,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:47:41,752 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:47:41,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41 WrapperNode [2024-11-07 07:47:41,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:47:41,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:47:41,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:47:41,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:47:41,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,778 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-07 07:47:41,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:47:41,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:47:41,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:47:41,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:47:41,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,797 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:47:41,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:47:41,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:47:41,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:47:41,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:47:41,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (1/1) ... [2024-11-07 07:47:41,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:47:41,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:47:41,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:47:41,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:47:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:47:41,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:47:41,847 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:47:41,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:47:41,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:47:41,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:47:41,916 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:47:41,918 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:47:42,144 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 07:47:42,144 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:47:42,152 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:47:42,153 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:47:42,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:47:42 BoogieIcfgContainer [2024-11-07 07:47:42,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:47:42,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:47:42,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:47:42,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:47:42,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:47:41" (1/3) ... [2024-11-07 07:47:42,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37babe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:47:42, skipping insertion in model container [2024-11-07 07:47:42,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:47:41" (2/3) ... [2024-11-07 07:47:42,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37babe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:47:42, skipping insertion in model container [2024-11-07 07:47:42,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:47:42" (3/3) ... [2024-11-07 07:47:42,162 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-36.i [2024-11-07 07:47:42,175 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:47:42,175 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:47:42,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:47:42,252 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;@24883f42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:47:42,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:47:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:47:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:47:42,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:42,265 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:42,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1273255444, now seen corresponding path program 1 times [2024-11-07 07:47:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:47:42,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209197852] [2024-11-07 07:47:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:42,299 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-07 07:47:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:47:42,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-07 07:47:42,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 07:47:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:42,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:47:42,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:47:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-07 07:47:42,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:47:42,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:47:42,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209197852] [2024-11-07 07:47:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209197852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:47:42,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:47:42,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:47:42,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697363990] [2024-11-07 07:47:42,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:47:42,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:47:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:47:42,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:47:42,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:47:42,541 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 07:47:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:47:42,558 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2024-11-07 07:47:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:47:42,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-07 07:47:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:47:42,569 INFO L225 Difference]: With dead ends: 95 [2024-11-07 07:47:42,569 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 07:47:42,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-07 07:47:42,575 INFO L432 NwaCegarLoop]: 68 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, 68 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-07 07:47:42,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:47:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 07:47:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 07:47:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:47:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-07 07:47:42,622 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 102 [2024-11-07 07:47:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:47:42,623 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-07 07:47:42,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 07:47:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-07 07:47:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:47:42,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:47:42,626 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:47:42,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2024-11-07 07:47:42,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-07 07:47:42,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:47:42,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:47:42,831 INFO L85 PathProgramCache]: Analyzing trace with hash 881071126, now seen corresponding path program 1 times [2024-11-07 07:47:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:47:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298772003] [2024-11-07 07:47:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:42,836 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-07 07:47:42,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:47:42,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-07 07:47:42,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 07:47:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:47:42,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:47:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:47:43,045 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-07 07:47:43,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1370786352] [2024-11-07 07:47:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:47:43,046 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 07:47:43,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 07:47:43,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 07:47:43,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-07 07:47:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:47:43,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 07:47:43,325 INFO L278 TraceCheckSpWp]: Computing forward predicates...