./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.mul4.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', 'a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b'] 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/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:13:21,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:13:21,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:13:21,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:13:21,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:13:21,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:13:21,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:13:21,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:13:21,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:13:21,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:13:21,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:13:21,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:13:21,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:13:21,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:13:21,560 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:13:21,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:13:21,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:13:21,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:13:21,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:13:21,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:13:21,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:13:21,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:13:21,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:13:21,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:13:21,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:13:21,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:13:21,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:13:21,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:13:21,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:13:21,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:21,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:13:21,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:13:21,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:13:21,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:13:21,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:13:21,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:13:21,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:13:21,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:13:21,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:13:21,565 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2024-11-07 03:13:21,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:13:21,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:13:21,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:13:21,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:13:21,872 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:13:21,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-07 03:13:23,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:13:23,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:13:23,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-07 03:13:23,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b0e25400/cf88d043b28044a88ad39ce01fc39076/FLAG6f11fdd63 [2024-11-07 03:13:23,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b0e25400/cf88d043b28044a88ad39ce01fc39076 [2024-11-07 03:13:23,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:13:23,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:13:23,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:23,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:13:23,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:13:23,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777674ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23, skipping insertion in model container [2024-11-07 03:13:23,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:13:23,622 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/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-11-07 03:13:23,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:23,718 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:13:23,732 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/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-11-07 03:13:23,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:23,801 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:13:23,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23 WrapperNode [2024-11-07 03:13:23,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:23,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:23,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:13:23,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:13:23,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,913 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 643 [2024-11-07 03:13:23,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:23,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:13:23,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:13:23,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:13:23,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,976 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 03:13:23,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:23,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:24,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:24,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:24,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:24,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:13:24,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:13:24,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:13:24,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:13:24,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (1/1) ... [2024-11-07 03:13:24,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:13:24,074 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 03:13:24,082 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 03:13:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:13:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:13:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 03:13:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:13:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:13:24,227 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:13:24,229 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:13:25,160 INFO L? ?]: Removed 297 outVars from TransFormulas that were not future-live. [2024-11-07 03:13:25,161 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:13:25,176 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:13:25,176 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:13:25,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:25 BoogieIcfgContainer [2024-11-07 03:13:25,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:13:25,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:13:25,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:13:25,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:13:25,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:13:23" (1/3) ... [2024-11-07 03:13:25,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be2f116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:25, skipping insertion in model container [2024-11-07 03:13:25,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:23" (2/3) ... [2024-11-07 03:13:25,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be2f116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:25, skipping insertion in model container [2024-11-07 03:13:25,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:25" (3/3) ... [2024-11-07 03:13:25,189 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-11-07 03:13:25,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:13:25,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:13:25,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:13:25,285 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;@3ed5ef9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:13:25,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:13:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 03:13:25,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:25,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:25,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:25,312 INFO L85 PathProgramCache]: Analyzing trace with hash -461519839, now seen corresponding path program 1 times [2024-11-07 03:13:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159127691] [2024-11-07 03:13:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:26,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159127691] [2024-11-07 03:13:26,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159127691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:26,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:26,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792943313] [2024-11-07 03:13:26,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:26,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:26,275 INFO L87 Difference]: Start difference. First operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:26,350 INFO L93 Difference]: Finished difference Result 297 states and 441 transitions. [2024-11-07 03:13:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-07 03:13:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:26,363 INFO L225 Difference]: With dead ends: 297 [2024-11-07 03:13:26,364 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 03:13:26,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:26,369 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:26,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 03:13:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-07 03:13:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2024-11-07 03:13:26,410 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 65 [2024-11-07 03:13:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:26,411 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2024-11-07 03:13:26,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2024-11-07 03:13:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 03:13:26,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:26,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:13:26,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:26,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1420517578, now seen corresponding path program 1 times [2024-11-07 03:13:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358473956] [2024-11-07 03:13:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358473956] [2024-11-07 03:13:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358473956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:26,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:26,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362660306] [2024-11-07 03:13:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:26,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:26,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:26,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:26,711 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:26,763 INFO L93 Difference]: Finished difference Result 298 states and 439 transitions. [2024-11-07 03:13:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:26,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 03:13:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:26,766 INFO L225 Difference]: With dead ends: 298 [2024-11-07 03:13:26,768 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 03:13:26,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:26,770 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:26,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 03:13:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-07 03:13:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.478021978021978) internal successors, (269), 182 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2024-11-07 03:13:26,789 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 66 [2024-11-07 03:13:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:26,789 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2024-11-07 03:13:26,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2024-11-07 03:13:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 03:13:26,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:26,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:26,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:13:26,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:26,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2110629786, now seen corresponding path program 1 times [2024-11-07 03:13:26,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:26,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636190552] [2024-11-07 03:13:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:27,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:27,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636190552] [2024-11-07 03:13:27,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636190552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:27,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:27,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:13:27,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784944120] [2024-11-07 03:13:27,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:27,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:13:27,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:13:27,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:13:27,246 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:27,320 INFO L93 Difference]: Finished difference Result 304 states and 446 transitions. [2024-11-07 03:13:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:13:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 03:13:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:27,324 INFO L225 Difference]: With dead ends: 304 [2024-11-07 03:13:27,324 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 03:13:27,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:13:27,325 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 212 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:27,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 775 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 03:13:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-11-07 03:13:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4702702702702704) internal successors, (272), 185 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 272 transitions. [2024-11-07 03:13:27,338 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 272 transitions. Word has length 67 [2024-11-07 03:13:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:27,338 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 272 transitions. [2024-11-07 03:13:27,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2024-11-07 03:13:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 03:13:27,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:27,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:27,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:13:27,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:27,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:27,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1725407879, now seen corresponding path program 1 times [2024-11-07 03:13:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109974517] [2024-11-07 03:13:27,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:28,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109974517] [2024-11-07 03:13:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109974517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:28,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 03:13:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210525762] [2024-11-07 03:13:28,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 03:13:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:28,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 03:13:28,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:13:28,354 INFO L87 Difference]: Start difference. First operand 186 states and 272 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:28,462 INFO L93 Difference]: Finished difference Result 329 states and 479 transitions. [2024-11-07 03:13:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:13:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 03:13:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:28,466 INFO L225 Difference]: With dead ends: 329 [2024-11-07 03:13:28,467 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 03:13:28,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:13:28,471 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 24 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:28,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1530 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:13:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 03:13:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2024-11-07 03:13:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 193 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2024-11-07 03:13:28,487 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 68 [2024-11-07 03:13:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:28,487 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2024-11-07 03:13:28,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2024-11-07 03:13:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 03:13:28,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:28,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:28,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:13:28,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:28,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash -158687039, now seen corresponding path program 1 times [2024-11-07 03:13:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:28,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416773259] [2024-11-07 03:13:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:29,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416773259] [2024-11-07 03:13:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416773259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:29,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:13:29,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384830055] [2024-11-07 03:13:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:29,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:13:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:29,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:13:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:13:29,253 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:29,367 INFO L93 Difference]: Finished difference Result 340 states and 494 transitions. [2024-11-07 03:13:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:13:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 03:13:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:29,369 INFO L225 Difference]: With dead ends: 340 [2024-11-07 03:13:29,372 INFO L226 Difference]: Without dead ends: 212 [2024-11-07 03:13:29,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:13:29,373 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 21 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:29,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1521 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:13:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-07 03:13:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2024-11-07 03:13:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4623115577889447) internal successors, (291), 199 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2024-11-07 03:13:29,386 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 69 [2024-11-07 03:13:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:29,387 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2024-11-07 03:13:29,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2024-11-07 03:13:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 03:13:29,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:29,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:29,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:13:29,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -814345339, now seen corresponding path program 1 times [2024-11-07 03:13:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285623649] [2024-11-07 03:13:29,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:29,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285623649] [2024-11-07 03:13:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285623649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:29,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:13:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849334124] [2024-11-07 03:13:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:29,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:13:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:13:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:13:29,958 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:30,071 INFO L93 Difference]: Finished difference Result 332 states and 482 transitions. [2024-11-07 03:13:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:13:30,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 03:13:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:30,073 INFO L225 Difference]: With dead ends: 332 [2024-11-07 03:13:30,073 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 03:13:30,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:13:30,076 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 214 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:30,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1703 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:13:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 03:13:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2024-11-07 03:13:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 194 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2024-11-07 03:13:30,086 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 69 [2024-11-07 03:13:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:30,087 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2024-11-07 03:13:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2024-11-07 03:13:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 03:13:30,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:30,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:30,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:13:30,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:30,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1464837146, now seen corresponding path program 1 times [2024-11-07 03:13:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:30,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362487594] [2024-11-07 03:13:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:30,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:30,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362487594] [2024-11-07 03:13:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362487594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:30,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:13:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030969382] [2024-11-07 03:13:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:30,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:13:30,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:30,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:13:30,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:13:30,450 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:30,512 INFO L93 Difference]: Finished difference Result 443 states and 641 transitions. [2024-11-07 03:13:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:13:30,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 03:13:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:30,514 INFO L225 Difference]: With dead ends: 443 [2024-11-07 03:13:30,516 INFO L226 Difference]: Without dead ends: 314 [2024-11-07 03:13:30,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:13:30,517 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 364 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:30,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 759 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-07 03:13:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 231. [2024-11-07 03:13:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4608695652173913) internal successors, (336), 230 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 336 transitions. [2024-11-07 03:13:30,528 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 336 transitions. Word has length 69 [2024-11-07 03:13:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 336 transitions. [2024-11-07 03:13:30,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 336 transitions. [2024-11-07 03:13:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 03:13:30,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:30,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:30,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 03:13:30,531 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:30,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1696516813, now seen corresponding path program 1 times [2024-11-07 03:13:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:30,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335263492] [2024-11-07 03:13:30,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:30,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:30,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335263492] [2024-11-07 03:13:30,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335263492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:30,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:30,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:13:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582620328] [2024-11-07 03:13:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:30,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:13:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:13:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:13:30,870 INFO L87 Difference]: Start difference. First operand 231 states and 336 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:31,024 INFO L93 Difference]: Finished difference Result 401 states and 575 transitions. [2024-11-07 03:13:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:13:31,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 03:13:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:31,026 INFO L225 Difference]: With dead ends: 401 [2024-11-07 03:13:31,026 INFO L226 Difference]: Without dead ends: 268 [2024-11-07 03:13:31,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:13:31,027 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 296 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:31,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 955 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:13:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-07 03:13:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 229. [2024-11-07 03:13:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4517543859649122) internal successors, (331), 228 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 331 transitions. [2024-11-07 03:13:31,042 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 331 transitions. Word has length 69 [2024-11-07 03:13:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:31,042 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 331 transitions. [2024-11-07 03:13:31,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 331 transitions. [2024-11-07 03:13:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 03:13:31,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:31,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:31,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 03:13:31,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:31,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1079174156, now seen corresponding path program 1 times [2024-11-07 03:13:31,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:31,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767257939] [2024-11-07 03:13:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:31,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:31,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:31,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767257939] [2024-11-07 03:13:31,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767257939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:31,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:13:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545350061] [2024-11-07 03:13:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:31,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:13:31,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:13:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:13:31,357 INFO L87 Difference]: Start difference. First operand 229 states and 331 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:31,417 INFO L93 Difference]: Finished difference Result 433 states and 620 transitions. [2024-11-07 03:13:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:13:31,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 03:13:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:31,419 INFO L225 Difference]: With dead ends: 433 [2024-11-07 03:13:31,420 INFO L226 Difference]: Without dead ends: 298 [2024-11-07 03:13:31,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:13:31,421 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 454 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:31,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 764 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-07 03:13:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 227. [2024-11-07 03:13:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4424778761061947) internal successors, (326), 226 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 326 transitions. [2024-11-07 03:13:31,428 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 326 transitions. Word has length 69 [2024-11-07 03:13:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:31,428 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 326 transitions. [2024-11-07 03:13:31,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 326 transitions. [2024-11-07 03:13:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 03:13:31,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:31,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:31,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 03:13:31,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:31,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1343504549, now seen corresponding path program 1 times [2024-11-07 03:13:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:31,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107463947] [2024-11-07 03:13:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:31,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107463947] [2024-11-07 03:13:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107463947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:13:31,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770912602] [2024-11-07 03:13:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:13:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:31,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:13:31,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:13:31,699 INFO L87 Difference]: Start difference. First operand 227 states and 326 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:31,748 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2024-11-07 03:13:31,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:13:31,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 03:13:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:31,750 INFO L225 Difference]: With dead ends: 356 [2024-11-07 03:13:31,750 INFO L226 Difference]: Without dead ends: 219 [2024-11-07 03:13:31,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:13:31,751 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 247 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:31,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 763 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-07 03:13:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-07 03:13:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4495412844036697) internal successors, (316), 218 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-07 03:13:31,757 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 69 [2024-11-07 03:13:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:31,758 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-07 03:13:31,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-07 03:13:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 03:13:31,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:31,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:31,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 03:13:31,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:31,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2025898208, now seen corresponding path program 1 times [2024-11-07 03:13:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621159766] [2024-11-07 03:13:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:32,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:32,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621159766] [2024-11-07 03:13:32,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621159766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:32,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:32,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:13:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411580272] [2024-11-07 03:13:32,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:32,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:13:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:13:32,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:13:32,032 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:32,086 INFO L93 Difference]: Finished difference Result 387 states and 553 transitions. [2024-11-07 03:13:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:13:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-07 03:13:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:32,087 INFO L225 Difference]: With dead ends: 387 [2024-11-07 03:13:32,087 INFO L226 Difference]: Without dead ends: 258 [2024-11-07 03:13:32,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:13:32,088 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 334 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:32,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 760 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-07 03:13:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 227. [2024-11-07 03:13:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4380530973451326) internal successors, (325), 226 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 325 transitions. [2024-11-07 03:13:32,101 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 325 transitions. Word has length 70 [2024-11-07 03:13:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:32,101 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 325 transitions. [2024-11-07 03:13:32,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 325 transitions. [2024-11-07 03:13:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 03:13:32,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:32,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:32,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 03:13:32,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:32,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2089643758, now seen corresponding path program 1 times [2024-11-07 03:13:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:32,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673081777] [2024-11-07 03:13:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:32,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:32,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:13:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:32,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:13:32,210 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:13:32,210 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:13:32,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 03:13:32,215 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:13:32,289 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:13:32,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:13:32 BoogieIcfgContainer [2024-11-07 03:13:32,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:13:32,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:13:32,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:13:32,294 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:13:32,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:25" (3/4) ... [2024-11-07 03:13:32,297 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:13:32,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:13:32,300 INFO L158 Benchmark]: Toolchain (without parser) took 8843.23ms. Allocated memory was 100.7MB in the beginning and 260.0MB in the end (delta: 159.4MB). Free memory was 76.8MB in the beginning and 88.8MB in the end (delta: -12.0MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,301 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:32,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.17ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 59.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.41ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 50.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,301 INFO L158 Benchmark]: Boogie Preprocessor took 123.31ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 44.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,303 INFO L158 Benchmark]: RCFGBuilder took 1137.22ms. Allocated memory is still 100.7MB. Free memory was 44.8MB in the beginning and 51.9MB in the end (delta: -7.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,303 INFO L158 Benchmark]: TraceAbstraction took 7111.11ms. Allocated memory was 100.7MB in the beginning and 260.0MB in the end (delta: 159.4MB). Free memory was 51.3MB in the beginning and 88.8MB in the end (delta: -37.5MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:32,303 INFO L158 Benchmark]: Witness Printer took 5.01ms. Allocated memory is still 260.0MB. Free memory was 88.8MB in the beginning and 88.8MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:32,305 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.50ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.17ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 59.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.41ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 50.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.31ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 44.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1137.22ms. Allocated memory is still 100.7MB. Free memory was 44.8MB in the beginning and 51.9MB in the end (delta: -7.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7111.11ms. Allocated memory was 100.7MB in the beginning and 260.0MB in the end (delta: 159.4MB). Free memory was 51.3MB in the beginning and 88.8MB in the end (delta: -37.5MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. * Witness Printer took 5.01ms. Allocated memory is still 260.0MB. Free memory was 88.8MB in the beginning and 88.8MB in the end (delta: 41.7kB). 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: 21]: 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 bitwiseAnd at line 168. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_64 mask_SORT_64 = (SORT_64)-1 >> (sizeof(SORT_64) * 8 - 4); [L36] const SORT_64 msb_SORT_64 = (SORT_64)1 << (4 - 1); [L38] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 60); [L39] const SORT_66 msb_SORT_66 = (SORT_66)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_64 var_65 = 0; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_1 input_6; [L51] SORT_1 input_7; [L52] SORT_1 input_8; [L53] SORT_1 input_9; [L55] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L55] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L56] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L57] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L58] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L59] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L60] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L61] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L62] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L63] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L64] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L65] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L66] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L67] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L68] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L69] SORT_1 state_87 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L70] SORT_1 state_92 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_10 init_13_arg_1 = var_11; [L73] state_12 = init_13_arg_1 [L74] SORT_1 init_16_arg_1 = var_14; [L75] state_15 = init_16_arg_1 [L76] SORT_10 init_19_arg_1 = var_11; [L77] state_18 = init_19_arg_1 [L78] SORT_1 init_21_arg_1 = var_14; [L79] state_20 = init_21_arg_1 [L80] SORT_3 init_26_arg_1 = var_24; [L81] state_25 = init_26_arg_1 [L82] SORT_1 init_28_arg_1 = var_14; [L83] state_27 = init_28_arg_1 [L84] SORT_3 init_31_arg_1 = var_24; [L85] state_30 = init_31_arg_1 [L86] SORT_1 init_33_arg_1 = var_14; [L87] state_32 = init_33_arg_1 [L88] SORT_3 init_38_arg_1 = var_24; [L89] state_37 = init_38_arg_1 [L90] SORT_1 init_40_arg_1 = var_14; [L91] state_39 = init_40_arg_1 [L92] SORT_3 init_43_arg_1 = var_24; [L93] state_42 = init_43_arg_1 [L94] SORT_1 init_45_arg_1 = var_14; [L95] state_44 = init_45_arg_1 [L96] SORT_1 init_70_arg_1 = var_14; [L97] state_69 = init_70_arg_1 [L98] SORT_1 init_75_arg_1 = var_14; [L99] state_74 = init_75_arg_1 [L100] SORT_1 init_88_arg_1 = var_14; [L101] state_87 = init_88_arg_1 [L102] SORT_1 init_93_arg_1 = var_14; [L103] state_92 = init_93_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L106] input_2 = __VERIFIER_nondet_uchar() [L107] input_4 = __VERIFIER_nondet_uint() [L108] input_5 = __VERIFIER_nondet_uint() [L109] input_6 = __VERIFIER_nondet_uchar() [L110] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L110] input_6 = input_6 & mask_SORT_1 [L111] input_7 = __VERIFIER_nondet_uchar() [L112] EXPR input_7 & mask_SORT_1 VAL [input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L112] input_7 = input_7 & mask_SORT_1 [L113] input_8 = __VERIFIER_nondet_uchar() [L114] EXPR input_8 & mask_SORT_1 VAL [input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L114] input_8 = input_8 & mask_SORT_1 [L115] input_9 = __VERIFIER_nondet_uchar() [L116] EXPR input_9 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L116] input_9 = input_9 & mask_SORT_1 [L119] SORT_1 var_17_arg_0 = state_15; [L120] SORT_10 var_17_arg_1 = state_12; [L121] SORT_10 var_17_arg_2 = var_11; [L122] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L123] EXPR var_17 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L123] var_17 = var_17 & mask_SORT_10 [L124] SORT_1 var_22_arg_0 = state_20; [L125] SORT_10 var_22_arg_1 = state_18; [L126] SORT_10 var_22_arg_2 = var_11; [L127] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_22=0, var_24=0, var_51=1, var_65=0] [L128] EXPR var_22 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L128] var_22 = var_22 & mask_SORT_10 [L129] SORT_10 var_23_arg_0 = var_17; [L130] SORT_10 var_23_arg_1 = var_22; [L131] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L132] SORT_1 var_29_arg_0 = state_27; [L133] SORT_3 var_29_arg_1 = state_25; [L134] SORT_3 var_29_arg_2 = var_24; [L135] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L136] EXPR var_29 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_51=1, var_65=0] [L136] var_29 = var_29 & mask_SORT_3 [L137] SORT_1 var_34_arg_0 = state_32; [L138] SORT_3 var_34_arg_1 = state_30; [L139] SORT_3 var_34_arg_2 = var_24; [L140] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1, var_65=0] [L141] EXPR var_34 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L141] var_34 = var_34 & mask_SORT_3 [L142] SORT_3 var_35_arg_0 = var_29; [L143] SORT_3 var_35_arg_1 = var_34; [L144] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L145] SORT_1 var_36_arg_0 = var_23; [L146] SORT_1 var_36_arg_1 = var_35; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1, var_65=0] [L147] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L147] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L148] SORT_1 var_41_arg_0 = state_39; [L149] SORT_3 var_41_arg_1 = state_37; [L150] SORT_3 var_41_arg_2 = var_24; [L151] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L152] EXPR var_41 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_51=1, var_65=0] [L152] var_41 = var_41 & mask_SORT_3 [L153] SORT_1 var_46_arg_0 = state_44; [L154] SORT_3 var_46_arg_1 = state_42; [L155] SORT_3 var_46_arg_2 = var_24; [L156] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1, var_65=0] [L157] EXPR var_46 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L157] var_46 = var_46 & mask_SORT_3 [L158] SORT_3 var_47_arg_0 = var_41; [L159] SORT_3 var_47_arg_1 = var_46; [L160] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L161] SORT_1 var_48_arg_0 = var_36; [L162] SORT_1 var_48_arg_1 = var_47; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1, var_65=0] [L163] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L163] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L164] SORT_1 var_52_arg_0 = var_48; [L165] SORT_1 var_52 = ~var_52_arg_0; [L166] SORT_1 var_53_arg_0 = var_51; [L167] SORT_1 var_53_arg_1 = var_52; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2, var_65=0] [L168] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L168] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L169] EXPR var_53 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L169] var_53 = var_53 & mask_SORT_1 [L170] SORT_1 bad_54_arg_0 = var_53; [L171] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2166 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2166 mSDsluCounter, 11092 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8265 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2827 mSDtfsCounter, 540 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=7, InterpolantAutomatonStates: 66, 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, 11 MinimizatonAttempts, 255 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 03:13:32,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:13:34,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:13:34,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:13:34,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:13:34,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:13:34,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:13:34,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:13:34,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:13:34,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:13:34,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:13:34,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:13:34,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:13:34,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:13:34,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:13:34,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:13:34,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:13:34,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:13:34,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:13:34,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:13:34,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:13:34,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:34,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:13:34,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:13:34,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:13:34,748 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:13:34,749 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:13:34,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:13:34,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:13:34,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:13:34,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:13:34,749 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2024-11-07 03:13:35,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:13:35,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:13:35,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:13:35,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:13:35,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:13:35,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-07 03:13:36,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:13:36,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:13:36,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-07 03:13:36,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2836441f3/cd0852e03e3b489b83dea38f17e6a779/FLAGad6b526dc [2024-11-07 03:13:36,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2836441f3/cd0852e03e3b489b83dea38f17e6a779 [2024-11-07 03:13:36,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:13:36,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:13:36,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:36,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:13:36,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:13:36,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:36,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e0e69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:36, skipping insertion in model container [2024-11-07 03:13:36,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:36" (1/1) ... [2024-11-07 03:13:36,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:13:36,937 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/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-11-07 03:13:37,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:37,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:13:37,058 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/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-11-07 03:13:37,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:37,137 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:13:37,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37 WrapperNode [2024-11-07 03:13:37,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:37,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:37,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:13:37,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:13:37,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,191 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 299 [2024-11-07 03:13:37,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:37,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:13:37,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:13:37,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:13:37,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,244 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 03:13:37,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:13:37,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:13:37,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:13:37,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:13:37,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (1/1) ... [2024-11-07 03:13:37,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:37,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:13:37,310 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 03:13:37,312 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 03:13:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:13:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:13:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 03:13:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:13:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:13:37,435 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:13:37,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:13:37,805 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-07 03:13:37,807 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:13:37,816 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:13:37,817 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:13:37,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:37 BoogieIcfgContainer [2024-11-07 03:13:37,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:13:37,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:13:37,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:13:37,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:13:37,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:13:36" (1/3) ... [2024-11-07 03:13:37,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1918cf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:37, skipping insertion in model container [2024-11-07 03:13:37,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:37" (2/3) ... [2024-11-07 03:13:37,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1918cf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:37, skipping insertion in model container [2024-11-07 03:13:37,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:37" (3/3) ... [2024-11-07 03:13:37,828 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-11-07 03:13:37,841 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:13:37,841 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:13:37,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:13:37,899 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;@28697a9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:13:37,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:13:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:13:37,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:37,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:13:37,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:37,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:13:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:37,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36981003] [2024-11-07 03:13:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:37,927 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 03:13:37,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:37,932 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 03:13:37,961 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 03:13:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:38,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-07 03:13:38,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:13:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:38,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:13:38,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:13:38,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36981003] [2024-11-07 03:13:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36981003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:38,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:38,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448085220] [2024-11-07 03:13:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:38,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:13:38,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:38,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:38,793 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:39,000 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-07 03:13:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:39,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 03:13:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:39,009 INFO L225 Difference]: With dead ends: 17 [2024-11-07 03:13:39,010 INFO L226 Difference]: Without dead ends: 9 [2024-11-07 03:13:39,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:39,016 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:39,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:13:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-07 03:13:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-07 03:13:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 03:13:39,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 03:13:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:39,044 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 03:13:39,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 03:13:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 03:13:39,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:39,045 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 03:13:39,052 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 03:13:39,249 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 03:13:39,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 03:13:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733850173] [2024-11-07 03:13:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:39,251 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 03:13:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:39,253 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 03:13:39,256 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 03:13:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:39,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-07 03:13:39,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:13:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:13:41,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:14:02,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse35 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_74~0#1|))) (let ((.cse30 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (not .cse35))) (.cse31 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse36 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse33 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) .cse35))) (let ((.cse32 (or .cse36 .cse33)) (.cse34 (or (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))) .cse35) .cse31)) (.cse25 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse28 (or .cse36 .cse30)) (.cse29 (or .cse31 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))) .cse35))) (let ((.cse27 (and .cse28 .cse29)) (.cse17 (not .cse25)) (.cse26 (and .cse32 .cse34)) (.cse22 (and .cse32 (or .cse31 .cse33) .cse34)) (.cse18 (and .cse28 .cse29 (or .cse30 .cse31)))) (let ((.cse10 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse19 (or .cse25 .cse18)) (.cse21 (or .cse25 .cse22)) (.cse24 (or .cse17 .cse26)) (.cse23 (or .cse17 .cse27))) (let ((.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_92~0#1|)) (.cse11 (and .cse23 (or .cse25 .cse27))) (.cse16 (and .cse24 (or .cse25 .cse26))) (.cse14 (and .cse21 .cse24)) (.cse13 (and .cse23 .cse19)) (.cse20 (not .cse10))) (let ((.cse3 (or .cse13 .cse20)) (.cse2 (or .cse14 .cse20)) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse1 (or .cse10 (and .cse21 (or .cse17 .cse22)))) (.cse15 (or .cse16 .cse20)) (.cse12 (or .cse11 .cse20)) (.cse4 (or .cse10 (and (or .cse17 .cse18) .cse19))) (.cse5 (not .cse0))) (and (or (and (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse4) .cse5)) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse6 .cse7))) .cse8)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse7 .cse9))))))))))) (or (and (or .cse10 .cse11) .cse12) .cse5) (or (and (or (and (or .cse10 .cse13) .cse3) .cse5) (or (and .cse2 (or .cse10 .cse14)) .cse0)) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse8)))))) (or .cse0 (and .cse15 (or .cse10 .cse16))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))) .cse9)))))))) (and (or (and .cse1 .cse15) .cse0) (or (and .cse12 .cse4) .cse5))))))))))) is different from false [2024-11-07 03:14:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-07 03:14:11,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:14:11,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733850173] [2024-11-07 03:14:11,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733850173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:14:11,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:14:11,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-07 03:14:11,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106186125] [2024-11-07 03:14:11,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:14:11,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 03:14:11,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:14:11,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 03:14:11,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=53, Unknown=1, NotChecked=14, Total=90 [2024-11-07 03:14:11,702 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:14:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:14:13,460 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 03:14:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:14:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 03:14:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:14:13,461 INFO L225 Difference]: With dead ends: 14 [2024-11-07 03:14:13,461 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 03:14:13,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=35, Invalid=78, Unknown=1, NotChecked=18, Total=132 [2024-11-07 03:14:13,462 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:14:13,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 6 Unchecked, 1.1s Time] [2024-11-07 03:14:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 03:14:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 03:14:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:14:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 03:14:13,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 03:14:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:14:13,467 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 03:14:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:14:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 03:14:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 03:14:13,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:14:13,467 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 03:14:13,477 INFO L552 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)] Ended with exit code 0 [2024-11-07 03:14:13,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 03:14:13,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:14:13,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:14:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 03:14:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:14:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785588266] [2024-11-07 03:14:13,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 03:14:13,673 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 03:14:13,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:14:13,677 INFO L229 MonitoredProcess]: Starting monitored process 4 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 03:14:13,680 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 (4)] Waiting until timeout for monitored process [2024-11-07 03:14:14,068 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 03:14:14,069 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 03:14:14,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-07 03:14:14,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:14:41,453 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~mask_SORT_1~0#1| (_ bv1 8)) (= (_ bv0 64) |c_ULTIMATE.start_main_~var_11~0#1|) (= |c_ULTIMATE.start_main_~state_27~0#1| |c_ULTIMATE.start_main_~state_32~0#1|) (exists ((|v_ULTIMATE.start_main_#t~nondet25#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet25#1_17|))) |c_ULTIMATE.start_main_~state_32~0#1|)) (exists ((|v_ULTIMATE.start_main_#t~nondet26#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet26#1_17|) (_ bv1 32))) |c_ULTIMATE.start_main_~state_39~0#1|)) (= (_ bv0 32) |c_ULTIMATE.start_main_~var_24~0#1|) (= |c_ULTIMATE.start_main_~state_39~0#1| |c_ULTIMATE.start_main_~state_44~0#1|) (let ((.cse1 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_20~0#1|)) (.cse21 ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_30~0#1| (_ bv4294967295 32)))) (.cse2 ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_42~0#1| (_ bv4294967295 32))))) (let ((.cse16 (= |c_ULTIMATE.start_main_~state_37~0#1| |c_ULTIMATE.start_main_~state_42~0#1|)) (.cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_39~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_32~0#1|)) (.cse7 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse40 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse39 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse40) ((_ zero_extend 24) .cse39)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse39) (not (= (_ bv0 8) .cse40)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8)) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse39) (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))))))))) (.cse8 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse22 (exists ((|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) (.cse6 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse38 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse36 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse38) ((_ zero_extend 24) .cse36)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse36) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))) (not (= (_ bv0 8) .cse38)) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8))) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse36)))))) (.cse0 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse34 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse33 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse34) ((_ zero_extend 24) .cse33)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse33) (not (= (_ bv0 8) .cse34)) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8))) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse33) (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))))))))) (.cse10 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse32 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse30 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse32) ((_ zero_extend 24) .cse30)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse30) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))) (not (= (_ bv0 8) .cse32)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8)) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse30)))))) (.cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse11 (and (exists ((|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse29 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse29) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse29)))) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_12~0#1|) (or .cse1 (= (_ bv0 64) |c_ULTIMATE.start_main_~state_18~0#1|))))) (or (and (let ((.cse5 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) (or (and (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse3 (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| .cse3) (= |c_ULTIMATE.start_main_~state_12~0#1| .cse3)))))) (and (or (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse4 ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul .cse4 .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse4) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse5) .cse6) (and .cse7 (or (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) .cse8)) (and (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse10) .cse11) (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse13))))))) (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse14))))) (_ bv0 8)))))) (and (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse13))))))) (not (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse14))))) (_ bv0 8)))))) .cse16 (or (and .cse7 (or .cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse18 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32))))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse18) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse18) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|)))))) (and .cse6 (or .cse5 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse19 ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul .cse19 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse19) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))))) (and (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|)))) .cse10) .cse11 (and (or (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse20 (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))))) (and (= .cse20 |c_ULTIMATE.start_main_~state_12~0#1|) (= .cse20 |c_ULTIMATE.start_main_~state_18~0#1|)))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse0))))) (= |c_ULTIMATE.start_main_~state_30~0#1| |c_ULTIMATE.start_main_~state_25~0#1|)) (and .cse16 (or (and (or (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) .cse22) .cse6) (and .cse10 (or (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) .cse9)) (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse23 (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| .cse23) (= |c_ULTIMATE.start_main_~state_12~0#1| .cse23)))))) (and .cse7 (or .cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse24 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32))))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse24) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|) (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 .cse24) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64)))))))) .cse11) (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse14))))) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse13)))))))))) (and (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse14))))) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse13))))))))) (let ((.cse27 (bvlshr (bvmul .cse21 .cse2) (_ bv2 64)))) (or (and .cse7 (or .cse8 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))))) (and (or (exists ((|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))) .cse22) .cse6) (and .cse0 (or (exists ((|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse28 (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)))) (and (= .cse28 |c_ULTIMATE.start_main_~state_12~0#1|) (= .cse28 |c_ULTIMATE.start_main_~state_18~0#1|)))) (and .cse1 (exists ((|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))))) (and .cse10 (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))))) .cse11)))))) (= (_ bv0 32) (bvadd |c_ULTIMATE.start_main_~mask_SORT_3~0#1| (_ bv1 32)))) is different from false